Transaction recordal method

ABSTRACT

A method of recording a transaction relating to a security document is disclosed. Coded data portions are provided on the security document, with each coded data portion encoding an identity of the security document and part of a signature. The signature is a digital signature of the identity. A sensing device senses at least one coded data portion. From the coded data portion sensed by the sensing device a determined identity and a determined signature part are determined. The security document is authenticated using the determined identity and the determined signature part. Transaction data associated with the security document, stored in a data store, is updated upon successful authentication.

CROSS REFERENCE TO RELATED APPLICATION

The present application is a continuation application of U.S. application Ser. No. 12/789,418 filed on May 27, 2010, now issued U.S. Pat. No. 8,096,466, which is a continuation application of U.S. application Ser. No. 11/041,650 filed on Jan. 25, 2005 now issued U.S. Pat. No. 7,784,681, the entire contents of which are now incorporated by reference.

FIELD OF THE INVENTION

The present invention broadly relates to a method and apparatus for the protection of products and security documents using machine readable tags disposed on or in a surface of the product or security document.

CROSS-REFERENCES

Various methods, systems and apparatus relating to the present invention are disclosed in the following co-pending applications and granted patents filed by the applicant or assignee of the present invention. The disclosures of all of these co-pending applications and granted patents are incorporated herein by cross-reference.

7,249,108 6,566,858 6,331,946 6,246,970 6,442,525 7,346,586 7,685,423 6,374,354 7,246,098 6,816,968 6,757,832 6,334,190 6,745,331 7,249,109 7,210,038 7,197,642 7,093,139 7,509,292 7,685,424 7,743,262 7,703,693 7,702,926 7,716,098 7,357,323 7,243,835 7,832,626 7,131,596 7,156,292 7,251,050 7,175,089 7,097,094 7,137,549 7,178,719 7,128,265 10/815,635 7,296,737 7,654,454 7,137,566 7,605,940 7,506,808 7,197,374 7,150,398 7,819,323 7,537,160 7,188,769 7,128,270 7,207,483 7,243,849 7,270,266 7,450,273 6,505,916 7,097,106 7,457,007 6,457,812 7,159,777 6,406,129 7,282,164 6,457,809 7,070,110 6,746,105 6,623,101 7,204,941 7,108,355 7,465,342 6,550,895 7,118,197 6,428,133 7,128,400 7,077,493 6,991,322 7,416,280 7,147,308 7,246,886 7,364,269 7,168,790 6,962,402 7,287,836 6,830,318 7,575,298 7,118,198 7,465,035 7,172,270 7,686,429 7,510,269 7,524,034 7,175,261 7,134,743 7,108,356 7,229,155 7,465,036 7,195,342 7,510,270 7,118,201 7,182,439 7,118,202 7,156,289 7,134,744 7,156,484 7,721,948 7,111,926 7,210,768 7,330,974 7,134,745 7,225,979 7,079,712 7,431,433 7,178,718 6,825,945 6,813,039 7,190,474 6,987,506 6,824,044 7,038,797 6,980,318 6,816,274 7,102,772 7,350,236 6,681,045 6,678,499 6,679,420 6,963,845 6,976,220 6,728,000 7,110,126 7,173,722 6,976,035 6,813,558 6,766,942 6,965,454 6,995,859 7,088,459 6,720,985 7,286,113 6,922,779 6,978,019 6,847,883 7,131,058 7,295,839 7,406,445 7,533,031 6,959,298 6,973,450 7,150,404 6,965,882 7,233,924 7,707,082 7,593,899 7,175,079 7,162,259 6,718,061 7,590,561 7,464,880 7,012,710 6,825,956 7,451,115 7,222,098 6,989,911 7,263,508 7,031,010 6,972,864 6,862,105 7,009,738 6,609,653 6,982,807 7,518,756 6,829,387 6,714,678 6,644,545 7,044,363 6,651,879 6,867,880 7,293,240 7,467,185 7,415,668 7,506,153 7,004,390 7,162,222 7,034,953 6,987,581 7,216,224 6,850,931 7,162,269 6,847,961 7,290,210 7,293,233 7,293,234 10/685,584 6,865,570 7,557,944 7,404,144 10/685,583 7,162,442 7,174,056 7,159,784 7,162,088 7,388,985 6,889,896 7,362,463 7,259,884 6,996,274 7,167,270 7,388,685 7,417,759 7,174,329 7,181,448 7,590,622 7,657,510 7,324,989 6,986,459 7,856,447 7,369,261 7,295,922 7,200,591 7,693,828 7,231,293 6,457,883 7,856,444 7,466,436 7,068,382 7,007,851 7,844,621 7,038,066 7,099,019 7,044,381 7,094,910 7,091,344 6,957,921 7,278,018 7,360,089 7,062,651 6,789,194 6,789,191 7,122,685 6,622,999 6,669,385 7,526,647 7,467,416 6,644,642 7,529,936 6,987,573 6,727,996 6,827,116 7,011,128 7,416,009 6,502,614 7,064,851 6,826,547 6,591,884 6,439,706 6,760,119 6,549,935 6,741,871 6,927,871 6,290,349 6,428,155 6,785,016 7,295,332 6,977,746 6,970,264 6,980,306 6,965,439 6,840,606 6,831,682 7,663,780 7,468,809 7,068,389 7,093,991 7,190,491 7,036,918 7,728,872 6,474,888 7,177,054 7,364,282 10/965,733 6,870,966 6,822,639 6,946,672 7,180,609 7,538,793 6,982,798 7,263,270 6,788,293 6,795,593 6,627,870 6,724,374 6,788,982 6,792,165 7,105,753 7,015,901 6,737,591 7,091,960 7,369,265 7,041,916 6,797,895 7,515,186 6,980,704 6,768,821 7,132,612 7,218,978 7,096,199 7,286,887 7,289,882 7,148,644 10/778,056 7,982,725 7,245,294 7,277,085 7,567,279 7,474,930 7,324,859 7,233,320 7,019,319 7,593,604 7,400,937 7,609,410 7,660,490 6,843,420 6,830,196 6,832,717 7,187,370 7,043,096 7,055,739 7,289,103 7,793,852 6,789,731 7,660,489 7,120,853 7,082,562 7,077,333 7,412,651 7,299,969 7,182,247 6,766,944 6,766,945 6,994,264 6,983,878 7,564,605 7,057,608 7,108,192 7,111,791 7,025,276 7,017,826 7,014,123 7,918,404 7,431,219 6,929,186 7,526,128 7,284,701 7,469,062 7,134,598 7,469,830 7,017,823 6,982,701 6,957,768 7,456,820 7,150,396 7,106,888 7,630,554 7,139,431 6,982,703 7,227,527 7,308,148 6,947,027 7,123,239 7,133,557 7,048,178 7,118,025 7,170,499 7,015,900 6,975,299 6,992,662 6,914,593 7,437,671 6,786,397 7,278,566 7,010,147 7,818,519 6,593,166 7,132,679 6,839,053 7,058,219 7,123,245 7,592,829 7,377,608 7,399,043 6,938,826 7,165,824 7,152,942 7,523,111 7,181,572 7,096,137 6,940,088 7,278,034 7,188,282 6,805,419 7,573,301 7,660,998 7,121,639 7,770,008 7,707,621 6,747,760 6,859,289 7,369,270 7,302,592 7,831,827 7,154,638 7,427,117 6,921,144 6,977,751 7,783,886 7,070,098 6,622,923 7,188,928 7,448,707 7,281,330 6,795,215 6,394,573 7,374,266 7,390,071 7,093,989 7,377,609 6,398,332 7,192,106 7,735,944 7,607,757 7,267,417 7,290,852 7,092,112 7,328,956 7,252,353 7,549,718 7,281,777 7,631,190 7,600,843 8,011,747 7,314,261 6,454,482 7,866,778 7,243,193 7,549,715 7,275,805 7,832,842 6,957,923 7,266,661 6,527,365 7,517,036 7,758,143 7,757,086 7,168,867 6,808,330 7,396,177 7,484,831 6,550,997 7,093,923 7,125,098 7,131,724 6,474,773 7,557,941

BACKGROUND Security Document Counterfeiting

Counterfeiting of security documents, such as money, is an increasing problem that now poses a real threat to the strength of global monetary systems. Software and high quality photographic and printing technology are making it easier for criminals to produce and pass counterfeit notes into the monetary system. Counterfeit currency can be used to support the underground, untaxed economy, and it is a global threat that could erode financial systems.

The main reason that counterfeiting remains a major concern is the ease and speed with which large quantities of counterfeit currency can be produced using counterfeit software combined with high quality photographic and printing equipment. The occurrence of counterfeiting is likely to increase because these technologies are more readily available, and the techniques are more easily understood by an increasingly larger segment of the criminal population.

Whilst, these technologies do not reproduce the watermarks, color shifting, embedded security threads, microprinting, and the general feel of the note, or the slightly raised print produced by engraved plates, in day-to-day transactions these features are often overlooked so that counterfeit notes are often accepted as legal tender. Counterfeit money can move through banks, money exchanges, casinos, and is even carried overseas, and there are growing opportunities for counterfeit currency to be passed into the monetary system. Most of the large economies around the world are therefore now committed to introducing new technologies, as well as additional regulations and processes to make identification of counterfeit notes easier, to thereby reduce the incidence of counterfeit notes entering the monetary system.

Another concern is that there are governments who knowingly support counterfeiters, and some are complicit in producing counterfeit currency. A related problem is that all of the major U.S. and European banks have established multiple correspondent relationships throughout the world so they may engage in international financial transactions for themselves and their clients in places where they do not have a physical presence. Many of these do not meet current regulatory or reporting requirements, and therefore make it difficult to gain sufficient information to actively combat counterfeiting.

In addition to the growing problem of currency counterfeiting, the risks associated with money laundering are also a major concern for many governments for two reasons:

-   -   1. Deregulation of global financial systems means that it is now         harder to combat money laundering; and     -   2. The funds involved in money laundering are increasing         rapidly.

There are two stages involved in money laundering: placement and layering, and integration.

Placement is the movement of cash from its source and placing it into circulation through financial institutions, casinos, shops, bureau de change and other businesses, both local and abroad. Placement can be carried out through many processes including currency smuggling, bank complicity, deregulated currency exchanges, blending to enable funds from illicit activities to be obscured in legal transactions, and using the proceeds to purchase less conspicuous assets.

The purpose of layering is to make it more difficult for law enforcement agencies to detect the trail of illegal proceeds. Layering methods can include converting cash to other monetary instruments such as banker's drafts and money orders, or selling assets bought with illicit funds.

The final stage of integration is the movement of previously laundered money into the economy, mainly through the banking system, to make transactions appear to be normal business earnings.

The first thing to note about money laundering is that criminals prefer to deal in cash because of its anonymity. In most financial transactions, there is a financial paper trail to link the person involved. Physical cash, however, has disadvantages. It is bulky and difficult to move. For example, 44 pounds of cocaine worth $1 million is equivalent to 256 pounds of street cash. The street cash is more than six times the weight of the drugs. The existing payment systems and cash are both problems for criminals, even more so for large transnational crime groups. This is where criminals and terrorists are often most vulnerable.

By limiting the opportunity for counterfeit notes, and funds from illicit activities to enter the economy at the money placement and layering phases, it becomes possible to restrict a wide range of money laundering activities.

To do this requires a detailed knowledge of cash flow movements that can only be gained by introducing the ability to track and trace the flow of individual notes within the monetary system, and the ability to link large reportable cash transactions to an individual's identity.

As a consequence, governments have endeavored to:

-   -   Improve international co-operation through governments to         address money laundering and counterfeiting concerns; and,     -   Establish additional national controls for the distribution and         supply of currency within a country.

Concerted efforts by governments to fight money laundering have been going on for the past fifteen years. The main international agreements addressing counterfeit and money laundering include: the United Nations Vienna Convention against Illicit Traffic in Narcotics Drugs and Psychotropic Substances (the Vienna Convention) and the 1990 Council of Europe Convention on Laundering (Adopted in November 1990, the Council of Europe Convention establishes a common criminal policy on money laundering. The convention lays down the principles for international co-operation among the contracting parties.).

The role of financial institutions in preventing and detecting money laundering has been the subject of pronouncements by the Basic Committee on Banking Supervision, the European Union, and the International Organization of Securities Commissions.

In December 1988, the G-10's Basle Committee on Banking Supervision issued a “statement of principles” with which the international banks of member states are expected to comply. These principles cover identifying customers, avoiding suspicious transactions, and co-operating with law enforcement agencies. In issuing these principles, the committee noted the risk to public confidence in banks, and thus to their stability, that can arise if they inadvertently become associated with money laundering.

The “United Nations Convention against Transnational Organized Crime” was tabled for signing in December 2000. The Convention urges governments to cooperate with one another in the detection, investigation and prosecution of money laundering. Signatories are obliged to reinforce requirements for customer identification, record-keeping and the reporting of suspicious transactions. Signatories are also recommended to set up financial intelligence units to collect, analyze and disseminate information.

Since the events of Sep. 11, 2001, UN Member States have emphasized the links between terrorism, transnational organized crime, the international drug trade and money laundering. The UN Security Council adopted resolution 1373 (2001) and it established the Counter-Terrorism Committee (CTC), which is mandated to monitor the implementation of the resolution urging States to prevent and suppress the financing of terrorist acts.

Other potential macroeconomic consequences of unchecked money laundering that have been noted by the International Monetary Fund (IMF) are inexplicable changes in money demand, contamination effects on legal financial transactions, and increased volatility of international capital flow and exchange rates as a consequence of unanticipated cross-border asset transfers. The latter point is especially important and poses a significant risk to the EU financial system as money laundering has a direct effect on the Foreign Exchange Market (FOREX) of an economy, which is vulnerable to the volume of cash involved in the trade.

Banks are susceptible to risks from money launderers on several fronts. There is a thin line between a financial institution suspecting that it is being used to launder money and the institution becoming criminally involved with the activity. Banks that are exposed as laundering money are likely to face costs associated with the subsequent loss of business on top of vast legal costs. At the very least, the discovery of a bank laundering money for an organised crime syndicate is likely to generate adverse publicity for the bank. Banks passing counterfeit notes to customers will also result in declining business as clients take business elsewhere. However, a much graver risk that banks face is that of criminal prosecution for laundering money. EU laws and directives state that if a financial institution in the EU is found to be assisting a money launderer and failed to follow the appropriate procedures as laid out by EU directives, the individual employee and respective supervisors, including company directors, are personally liable to imprisonment or fines. This is the reason why the EU directives on money laundering include the “know your customer” initiative.

As a result due diligence measures have been implemented by financial service providers under regulatory supervision to ensure the integrity of those conducting business with the institution. These consist of four sub-categories:

-   -   1) identification;     -   2) know your customer;     -   3) record keeping; and     -   4) suspicious activity reporting.

These are all time consuming and difficult to manage.

In addition to international efforts to combat counterfeiting and money laundering, most OECD governments have introduced a wide range of domestic statutes governing the distribution, and management of currency. Some of these are needed to support international approaches, and others have been introduced to reduce local opportunities for terrorists or criminals to derive benefit from counterfeiting or money laundering activities. While it is not possible to consider all of these, a few U.S statutory requirements are considered here to highlight the emerging requirements that any new currency validation and tracking system might be required to meet to support national and international objectives.

Within the U.S., national distribution and supply of U.S. currency is regulated by the U.S Monetary Policy, and implemented by the Federal Reserve and the Department of Treasury, and monitored by the Secret Service. The Bureau of Engraving and Printing (BEP), which is a division of the U.S. Department of Treasury, serves as the United States' security printer. It produces the Nation's currency, most of its postage stamps, and other security documents (The first important distinction is that while the Federal Reserve issues Federal Reserve notes, the Treasury issues coins. Consequently, the Federal Reserve determines the amount of new currency of each denomination to be printed annually by the US Bureau of Engraving and Printing (BEP)).

In the case of currency, the Federal Reserve Banks verify all notes deposited with them by the banking industry on a note-by-note basis. During this verification, deposited currency is counted for accuracy, counterfeit notes are identified, and unfit notes are destroyed. The BEP, in conjunction with the Department of Treasury, Federal Reserve and Secret Service, are continuously working on changes that are required to protect the integrity of the monetary system.

Additionally, the Internal Revenue Code (IRC) requires anyone involved in a trade or business, except financial institutions, to report currency received for goods or services in excess of $10,000. The Bank Secrecy Act (BSA) mandates the reporting of certain currency transactions conducted by financial institutions, the disclosure of foreign bank accounts, and the reporting of the transportation of currency exceeding $10,000 across United States borders.

The Internal Revenue Service (IRS) is one of the key agencies involved in money laundering investigations. Tax evasion, public corruption, health care fraud, money laundering and drug trafficking are all examples of the types of crimes that revolve around cash. A financial investigation often becomes the key to a conviction.

In addition to providing physical protection to the leaders of the United States of America, the Secret Service has set as its highest investigative priority the identification and suppression of counterfeit currency production and distribution networks. With 60% of genuine U.S. currency circulating outside of the U.S, the dollar continues to be a target for transnational counterfeiting activity.

The main objective of the U.S. Patriot Act 2001 is to amend certain laws within the constitution of the United States of America to assist with the national and global fight against terrorism. These laws relate to reporting requirements for currency received in non-financial trade or business. These include the name, address, and identification information of the person from whom the currency was received, the amount of currency received, the date and nature of the transaction, and the identification of the person filing the report.

In their effort to avoid using traditional financial institutions, many criminals are forced to move large quantities of currency in bulk form through airports, border crossings, and other ports of entry where the currency can be smuggled out of the United States and placed in a foreign financial institution or sold on the black market. The transportation and smuggling of cash in bulk form may now be one of the most common forms of money laundering, and the movement of large sums of cash is one of the most reliable warning signs of drug trafficking, terrorism, money laundering, racketeering, tax evasion and similar crimes.

To support the above international and national initiatives, the technology industry has also initiated a number of programs. For example, IBM and Searchspace have joined forces to launch the IBM Anti-Money Laundering Service, a hosted computer service to help meet new U.S. Patriot Act requirements, which requires firms to implement new technologies to detect and prevent money laundering schemes by terrorists and other criminals. Unisys also provides anti-money laundering and fraud detection services. These services have been provided to police forces and leading financial institutions.

Given the wide range of approaches adopted to support international co-operative efforts to limit terrorist and criminal activity, there is a growing recognition that organized crime is increasingly operating through more fluid network structures rather than more formal hierarchies.

This therefore requires the use of new methods and technologies in order to comply with the wide range of regulations and recommendations needed to combat laundering and counterfeiting.

These new methods and technologies should make it easy to validate notes, automate many of the statutory cash transaction reporting requirements, and provide the capability for security agencies to detect crime patterns through cash flow tracking.

An existing solution to the problem involves the use of note tracking using RFID chips.

Due to the Euro's broad cross-border reach, the European Central Bank (ECB) and criminal investigators in Europe are concerned about increases in counterfeiting, as well as a possible increase in money laundering. There are now over 10 billion bank notes in circulation, with 4.5 billion being held in reserve to accommodate potential leaps in demand. Last year, Greek authorities were confronted with 2,411 counterfeiting cases while authorities in Poland arrested a gang suspected of making and putting over a million fake euros into circulation.

Because of these concerns, the application of RFID (Radio Frequency Identification) technology to paper currency is currently being investigated by the European Central Bank and Hitachi.

Hitachi Ltd. announced plans in July 2003 for a chip designed for high denomination currency notes that would pack RF circuitry and ROM in a 0.4-mm square circuit that is only 60 microns thick. The Hitachi “mu-chip” will be capable of wirelessly transmitting a 128-bit number when radio signals are beamed at it. Besides acting as a digital watermark, such RFID chips could speed up routine bank processes such as counting. A stack of notes can be passed through a reader with the sum determined automatically, similar to the way that inventory is tracked in an RFID-based system.

However there are a number of difficulties that associated with such a solution.

First, there are concerns about the high costs associated with producing and integrating each chip into a note. Manufacturing processes are also considered a major hurdle to embedding a low-cost antenna and chip in bank notes.

There are also concerns about the robustness of a chip solution. Bank notes have a thickness of only about 80 microns. Once a 60 micron thick RFID chip is connected to its antenna, it is likely to be well over 100 microns thick. They will therefore be at risk of snagging on an object or surface, and being torn out of the note paper. Notes rubbing against each other in a wallet may cause the RFID chips to tear out of the notes. Another major concern is the robustness of the chip itself. Bank notes undergo repeated folding, they are accidentally put through washing machines, and they may receive large electrostatic shocks.

All of these will make it difficult for the issuers to guarantee that chips will continue to function properly for the expected life of the note. People are unlikely to accept that their notes are invalid simply because the RFID chips have been torn out or damaged, so there will not be an expectation that all notes must have RFID chips. So, a forger can pass off notes which never had chips simply by tearing small holes where the chips have purportedly ‘snagged on something and been torn out’.

There are also concerns about privacy. With the potential to track and trace cash, individuals may become concerned that cash will lose its anonymity when buying goods. There are also concerns by privacy advocates that a scanner in the hands of criminals could be used to remotely determine the amount of cash being carried by an individual without their knowledge. This could place them at risk of attack.

Thus, there are many factors that suggest that an RFID solution may not be feasible for validating and tracking currency.

Surface Coding Background

The Netpage surface coding consists of a dense planar tiling of tags. Each tag encodes its own location in the plane. Each tag also encodes, in conjunction with adjacent tags, an identifier of the region containing the tag. This region ID is unique among all regions. In the Netpage system the region typically corresponds to the entire extent of the tagged surface, such as one side of a sheet of paper.

The surface coding is designed so that an acquisition field of view large enough to guarantee acquisition of an entire tag is large enough to guarantee acquisition of the ID of the region containing the tag. Acquisition of the tag itself guarantees acquisition of the tag's two-dimensional position within the region, as well as other tag-specific data. The surface coding therefore allows a sensing device to acquire a region ID and a tag position during a purely local interaction with a coded surface, e.g. during a “click” or tap on a coded surface with a pen.

The use of netpage surface coding is described in more detail in the following copending patent applications, U.S. Ser. No. 10/815,647, entitled “Obtaining Product Assistance” filed on 2^(nd) Apr. 2004; and U.S. Ser. No. 10/815,609, entitled “Laser Scanner Device for Printed Product Identification Cod” filed on 2^(nd) Apr. 2004.

Cryptography Background

Cryptography is used to protect sensitive information, both in storage and in transit, and to authenticate parties to a transaction. There are two classes of cryptography in widespread use: secret-key cryptography and public-key cryptography.

Secret-key cryptography, also referred to as symmetric cryptography, uses the same key to encrypt and decrypt a message. Two parties wishing to exchange messages must first arrange to securely exchange the secret key.

Public-key cryptography, also referred to as asymmetric cryptography, uses two encryption keys. The two keys are mathematically related in such a way that any message encrypted using one key can only be decrypted using the other key. One of these keys is then published, while the other is kept private. They are referred to as the public and private key respectively. The public key is used to encrypt any message intended for the holder of the private key. Once encrypted using the public key, a message can only be decrypted using the private key. Thus two parties can securely exchange messages without first having to exchange a secret key. To ensure that the private key is secure, it is normal for the holder of the private key to generate the public-private key pair.

Public-key cryptography can be used to create a digital signature. If the holder of the private key creates a known hash of a message and then encrypts the hash using the private key, then anyone can verify that the encrypted hash constitutes the “signature” of the holder of the private key with respect to that particular message, simply by decrypting the encrypted hash using the public key and verifying the hash against the message. If the signature is appended to the message, then the recipient of the message can verify both that the message is genuine and that it has not been altered in transit.

Secret-key can also be used to create a digital signature, but has the disadvantage that signature verification can also be performed by a party privy to the secret key.

To make public-key cryptography work, there has to be a way to distribute public keys which prevents impersonation. This is normally done using certificates and certificate authorities. A certificate authority is a trusted third party which authenticates the association between a public key and a person's or other entity's identity. The certificate authority verifies the identity by examining identity documents etc., and then creates and signs a digital certificate containing the identity details and public key. Anyone who trusts the certificate authority can use the public key in the certificate with a high degree of certainty that it is genuine. They just have to verify that the certificate has indeed been signed by the certificate authority, whose public key is well-known.

To achieve comparable security to secret-key cryptography, public-key cryptography utilises key lengths an order of magnitude larger, i.e. a few thousand bits compared with a few hundred bits.

Schneier B. (Applied Cryptography, Second Edition, John Wiley & Sons 1996) provides a detailed discussion of cryptographic techniques.

SUMMARY OF THE INVENTION

According to an aspect of the present invention there is provided a method of recording a transaction relating to a security document, the method comprising the steps of:

-   -   providing on the security document a plurality of coded data         portions, each coded data portion encoding an identity of the         security document and part of a signature, the signature being a         digital signature of at least part of the identity;     -   sensing by a sensing device at least one coded data portion     -   determining from the coded data portion sensed by the sensing         device a determined identity and at least one determined         signature part;     -   authenticating the security document using the determined         identity and the at least one determined signature part; and     -   updating, upon successful authentication, transaction data         associated with the security document stored in a data store.

Other aspects are also disclosed.

BRIEF DESCRIPTION OF THE DRAWINGS

An example of the present invention will now be described with reference to the accompanying drawings, in which:—

FIG. 1 is an example of a document including Hyperlabel encoding;

FIG. 2 is an example of a system for interacting with the Hyperlabel document of FIG. 1;

FIG. 3 is a further example of system for interacting with the Hyperlabel document of FIG. 1;

FIG. 4. is a first example of a tag structure;

FIG. 5. is an example of a symbol unit cell for the tag structure of FIG. 4;

FIG. 6. is an example of an array of the symbol unit cells of FIG. 5;

FIG. 7. is an example of symbol bit ordering in the unit cells of FIG. 5;

FIG. 8. is an example of the tag structure of FIG. 4 with every bit set;

FIG. 9. is an example of tag types within a tag group for the tag structure of FIG. 4;

FIG. 10. is an example of continuous tiling of the tag groups of FIG. 9;

FIG. 11. is an example of the orientation-indicating cyclic position codeword R for the tag group of FIG. 4;

FIG. 12. is an example of a local codeword A for the tag group of FIG. 4;

FIG. 13. is an example of distributed codewords B, C, D and E, for the tag group of FIG. 4;

FIG. 14. is an example of a layout of complete tag group;

FIG. 15. is an example of a code word for the tag group of FIG. 4;

FIG. 16. is an example of an alternative tag group for the tag structure of FIG. 4;

FIG. 17. is a second example of a tag structure;

FIG. 18. is a third example of a tag structure;

FIG. 19 is an example of an item signature object model;

FIG. 20 is an example of Hyperlabel tags applied to a currency note;

FIG. 21 is an example of a note creation and distribution process;

FIG. 22. is an example of Scanning at Retailer interactions;

FIG. 23. is an example of Online Scanning interaction detail;

FIG. 24. is an example of Offline Scanning interaction details;

FIG. 25. is an example of netpage Pen Scanning interactions;

FIG. 26. is an example of netpage Pen Scanning interaction details;

FIG. 27. is an example of a Hyperlabel tag class diagram;

FIG. 28. is an example of a note ID class diagram

FIG. 29. is an example of an Object Description, ownership and aggregation class diagram;

FIG. 30. is an example of an Object Scanning History class diagram;

FIG. 31. is an example of scanner class diagram;

FIG. 32. is an example of an object ID hot list diagram;

FIG. 33. is an example of a valid ID range class diagram;

FIG. 34. is an example of Public Key List class diagram;

FIG. 35. is an example of a Trusted Authenticator class diagram;

FIG. 36. is an example of Tagging and Tracking Object Management;

FIG. 37. is an example of use of a currency counter;

FIG. 38. is an example of use of an automatic teller machine;

FIG. 39. is an example of use of a cash register;

FIG. 40. is an example of a Hyperlabel supermarket checkout;

FIG. 41. is an example of a handheld validity scanner;

FIG. 42. is an example of use of a handheld validity scanner;

FIG. 43. is an example of use of a sensing pen; and,

FIG. 44 is an example of a vending machine.

DETAILED DESCRIPTION OF THE DRAWINGS

The Netpage surface coding consists of a dense planar tiling of tags. Each tag encodes its own location in the plane. Each tag also encodes, in conjunction with adjacent tags, an identifier of the region containing the tag. In the Netpage system, the region typically corresponds to the entire extent of the tagged surface, such as one side of a sheet of paper.

Hyperlabel is the adaptation of the Netpage tags for use in unique item identification for a wide variety of applications, including security document protection, object tracking, pharmaceutical security, supermarket automation, interactive product labels, web-browsing from printed surfaces, paper based email, and many others.

Using Memjet™ digital printing technology (which is the subject of a number of pending U.S. patent applications including U.S. Ser. No. 10/407,212), Hyperlabel tags are printed over substantially an entire surface, such as a security document, bank note, or pharmaceutical packaging, using infrared (IR) ink. By printing the tags in infrared-absorptive ink on any substrate which is infra-red-reflective, the near-infrared wavelengths, and hence the tags are invisible to the human eye but are easily sensed by a solid-state image sensor with an appropriate filter. This allows machine readable information to be encoded over a large portion of the note or other surface, with no visible effect on the original note text or graphics thereon. A scanning laser or image sensor can read the tags on any part of the surface to performs associated actions, such as validating each individual note or item.

An example of such a hyperlabel encoded document, is shown in FIG. 1. In this example, the hyperlabel document consists of graphic data 2 printed using visible ink, and coded data 3 formed from hyperlabel tags 4. The document includes an interactive element 6 defined by a zone 7 which corresponds to the spatial extent of a corresponding graphic 8. In use, the tags encode tag data including an ID. By sensing at least one tag, and determining and interpreting the encoded ID using an appropriate system, this allows the associated actions to be performed.

In one example, a tag map is used to define a layout of the tags on the hyperlabel document based on the ID encoded within the tag data. The ID can also be used to reference a document description which describes the individual elements of the hyperlabel document, and in particular describes the type and spatial extent (zone) of interactive elements, such as a button or text field. Thus, in this example, the element 6 has a zone 7 which corresponds to the spatial extent of a corresponding graphic 8. This allows a computer system to interpret interactions with the hyperlabel document.

In position indicating techniques, the ID encoded within the tag data of each tag allows the exact position of the tag on the hyperlabel document to be determined from the tag map. The position can then be used to determine whether the sensed tag is positioned in a zone of an interactive element from the document description.

In object indicating techniques, the ID encoded within the tag data allows the presence of the tag in a region of the document to be determined from the tag map (the relative position of the tag within the region may also be indicated). In this case, the document description can be used to determine whether the region corresponds to the zone of an interactive element.

An example of this process will now be described with reference to FIGS. 2 and 3 which show how a sensing device in the form of a netpage or hyperlabel pen 101, which interacts with the coded data on a printed hyperlabel document 1, such as a security document, label, product packaging or the like.

The hyperlabel pen 101 senses a tag using an area image sensor and detects tag data. The hyperlabel pen 101 uses the sensed coded data to generate interaction data which is transmitted via a short-range radio link 9 to a relay 44, which may form part of a computer 75 or a printer 601. The relay sends the interaction data, via a network 19, to a document server 10, which uses the ID to access the document description, and interpret the interaction. In appropriate circumstances, the document server sends a corresponding message to an application server 13, which can then perform a corresponding action.

In an alternative embodiment, the PC, Web terminal, netpage printer or relay device may communicate directly with local or remote application software, including a local or remote Web server. Relatedly, output is not limited to being printed by the netpage printer. It can also be displayed on the PC or Web terminal, and further interaction can be screen-based rather than paper-based, or a mixture of the two.

Typically hyperlabel pen users register with a registration server 11, which associates the user with an identifier stored in the respective hyperlabel pen. By providing the sensing device identifier as part of the interaction data, this allows users to be identified, allowing transactions or the like to be performed.

Hyperlabel documents are generated by having an ID server generate an ID which is transferred to the document server 10. The document server 10 determines a document description and then records an association between the document description and the ID, to allow subsequent retrieval of the document description using the ID.

The ID is then used to generate the tag data, as will be described in more detail below, before the document is printed by the hyperlabel printer 601, using the page description and the tag map.

Each tag is represented by a pattern which contains two kinds of elements. The first kind of element is a target. Targets allow a tag to be located in an image of a coded surface, and allow the perspective distortion of the tag to be inferred. The second kind of element is a macrodot. Each macrodot encodes the value of a bit by its presence or absence.

The pattern is represented on the coded surface in such a way as to allow it to be acquired by an optical imaging system, and in particular by an optical system with a narrowband response in the near-infrared. The pattern is typically printed onto the surface using a narrowband near-infrared ink.

In the Hyperlabel system the region typically corresponds to the surface of an entire product item, or to a security document, and the region ID corresponds to the unique item ID. For clarity in the following discussion we refer to items and item IDs (or simply IDs), with the understanding that the item ID corresponds to the region ID.

The surface coding is designed so that an acquisition field of view large enough to guarantee acquisition of an entire tag is large enough to guarantee acquisition of the ID of the region containing the tag. Acquisition of the tag itself guarantees acquisition of the tag's two-dimensional position within the region, as well as other tag-specific data. The surface coding therefore allows a sensing device to acquire a region ID and a tag position during a purely local interaction with a coded surface, e.g. during a “click” or tap on a coded surface with a pen.

A wide range of different tag structures can be used, and some examples will now be described.

First Example Tag Structure

FIG. 4 shows the structure of a complete tag. Each of the four black circles is a target. The tag, and the overall pattern, has four-fold rotational symmetry at the physical level.

Each square region represents a symbol, and each symbol represents four bits of information.

FIG. 5 shows the structure of a symbol. It contains four macrodots, each of which represents the value of one bit by its presence (one) or absence (zero).

The macrodot spacing is specified by the parameter s throughout this document. It has a nominal value of 143 μm, based on 9 dots printed at a pitch of 1600 dots per inch. However, it is allowed to vary by ±10% according to the capabilities of the device used to produce the pattern.

FIG. 6 shows an array of nine adjacent symbols. The macrodot spacing is uniform both within and between symbols.

FIG. 7 shows the ordering of the bits within a symbol. Bit zero is the least significant within a symbol; bit three is the most significant. Note that this ordering is relative to the orientation of the symbol. The orientation of a particular symbol within the tag is indicated by the orientation of the label of the symbol in the tag diagrams. In general, the orientation of all symbols within a particular segment of the tag have the same orientation, consistent with the bottom of the symbol being closest to the centre of the tag.

Only the macrodots are part of the representation of a symbol in the pattern. The square outline of a symbol is used in this document to more clearly elucidate the structure of a tag. FIG. 8, by way of illustration, shows the actual pattern of a tag with every bit set. Note that, in practice, every bit of a tag can never be set.

A macrodot is nominally circular with a nominal diameter of (5/9)s. However, it is allowed to vary in size by ±10% according to the capabilities of the device used to produce the pattern.

A target is nominally circular with a nominal diameter of (17/9)s. However, it is allowed to vary in size by ±10% according to the capabilities of the device used to produce the pattern.

The tag pattern is allowed to vary in scale by up to ±10% according to the capabilities of the device used to produce the pattern. Any deviation from the nominal scale is recorded in the tag data to allow accurate generation of position samples.

Each symbol shown in the tag structure in FIG. 4 has a unique label. Each label consists an alphabetic prefix and a numeric suffix.

Tag Group

Tags are arranged into tag groups. Each tag group contains four tags arranged in a square. Each tag therefore has one of four possible tag types according to its location within the tag group square. The tag types are labelled 00, 10, 01 and 11, as shown in FIG. 9.

Each tag in the tag group is rotated as shown in the figure, i.e. tag type 00 is rotated 0 degrees, tag type 10 is rotated 90 degrees, tag type 11 is rotated 180 degrees, and tag type 01 is rotated 270 degrees.

FIG. 10 shows how tag groups are repeated in a continuous tiling of tags. The tiling guarantees the any set of four adjacent tags contains one tag of each type.

Orientation-Indicating Cyclic Position Code

The tag contains a 2⁴-ary (4, 1) cyclic position codeword which can be decoded at any of the four possible orientations of the tag to determine the actual orientation of the tag. Symbols which are part of the cyclic position codeword have a prefix of “R” and are numbered 0 to 3 in order of increasing significance.

The cyclic position codeword is (0, 7, 9, E₁₆). Note that it only uses four distinct symbol values, even though a four-bit symbol has sixteen possible values. During decoding, any unused symbol value should, if detected, be treated as an erasure. To maximise the probability of low-weight bit error patterns causing erasures rather than symbol errors, the symbol values are chosen to be as evenly spaced on the hypercube as possible.

The minimum distance of the cyclic position code is 4, hence its error-correcting capacity is one symbol in the presence of up to one erasure, and no symbols in the presence of two or more erasures.

The layout of the orientation-indicating cyclic position codeword is shown in FIG. 11.

Local Codeword

The tag locally contains one complete codeword which is used to encode information unique to the tag. The codeword is of a punctured 2⁴-ary (13, 7) Reed-Solomon code. The tag therefore encodes up to 28 bits of information unique to the tag.

The layout of the local codeword is shown in FIG. 12.

Distributed Codewords

The tag also contains fragments of four codewords which are distributed across the four adjacent tags in a tag group and which are used to encode information common to a set of contiguous tags. Each codeword is of a 2⁴-ary (15, 11) Reed-Solomon code. Any four adjacent tags therefore together encode up to 176 bits of information common to a set of contiguous tags.

The layout of the four complete codewords, distributed across the four adjacent tags in a tag group, is shown in FIG. 13. The order of the four tags in the tag group in FIG. 13 is the order of the four tags in FIG. 9.

FIG. 14 shows the layout of a complete tag group.

Reed-Solomon Encoding

Local Codeword

The local codeword is encoded using a punctured 2⁴-ary (13, 7) Reed-Solomon code. The code encodes 28 data bits (i.e. seven symbols) and 24 redundancy bits (i.e. six symbols) in each codeword. Its error-detecting capacity is six symbols. Its error-correcting capacity is three symbols.

As shown in FIG. 15, codeword coordinates are indexed in coefficient order, and the data bit ordering follows the codeword bit ordering.

The code is a 2⁴-ary (15, 7) Reed-Solomon code with two redundancy coordinates removed. The removed coordinates are the most significant redundancy coordinates.

The code has the following primitive polynominal: p(x)=x ⁴ +x+1  (EQ 1)

The code has the following generator polynominal: g(x)=(x+α)(x+α ²) . . . (x+α ⁸)  (EQ 2) Distributed Codewords

The distributed codewords are encoded using a 2⁴-ary (15, 11) Reed-Solomon code. The code encodes 44 data bits (i.e. eleven symbols) and 16 redundancy bits (i.e. four symbols) in each codeword. Its error-detecting capacity is four symbols. Its error-correcting capacity is two symbols.

Codeword coordinates are indexed in coefficient order, and the data bit ordering follows the codeword bit ordering.

The code has the same primitive polynominal as the local codeword code.

The code has the following generator polynominal: g(x)=(x+α)(x+α ²) . . . (x+α ⁴)  (EQ 3) Tag Coordinate Space

The tag coordinate space has two orthogonal axes labelled x and y respectively. When the positive x axis points to the right then the positive y axis points down.

The surface coding does not specify the location of the tag coordinate space origin on a particular tagged surface, nor the orientation of the tag coordinate space with respect to the surface. This information is application-specific. For example, if the tagged surface is a sheet of paper, then the application which prints the tags onto the paper may record the actual offset and orientation, and these can be used to normalise any digital ink subsequently captured in conjunction with the surface.

The position encoded in a tag is defined in units of tags. By convention, the position is taken to be the position of the centre of the target closest to the origin.

Tag Information Content

Field Definitions

Table 1 defines the information fields embedded in the surface coding. Table 2 defines how these fields map to codewords.

TABLE 1 Field definitions width field (bits) description per tag x coordinate  9 or 13 The unsigned x coordinate of the tag allows maximum coordinate values of approximately 0.9 m and 14 m respectively. y coordinate  9 or 13 The unsigned y coordinate of the tag allows maximum coordinate values of approximately 0.9 m and 14 m respectively active area flag  1 b′1′ indicates whether the area (the diameter of the area ntered on the tag, is nominally 5 times the diagonal size of the tag) immediately surrounding the tag intersects an active area data fragment flag  1 A flag indicating whether a data fragment is present (see next field). b′1′ indicates the presence of a data fragment. If the data fragment is present then the width of the x and y coordinate fields is 9. If it is absent then the width is 13. data fragment  0 or 8 A fragment of an embedded data stream. per tag group (i.e. per region) encoding format  8 The format of the encoding. 0: the present encoding Other values are reserved. region flags  8 Flags controlling the interpretation of region data. 0: region ID is an EPC 1: region has signature 2: region has embedded data 3: embedded data is signature Other bits are reserved and must be zero. tag size ID  8 The ID of the tag size. 0: the present tag size the nominal tag size is 1.7145 mm, based on 1600 dpi, 9 dots per macrodot, and 12 macrodots per tag Other values are reserved. region ID 96 The ID of the region containing the tags. signature 36 The signature of the region. high-order  4 The width of the high-order part of the x and coordinate width y coordinates of the tag. (w) high-order x  0 to 15 High-order part of the x coordinate of the coordinate tag expands the maximum coordinate values to approximately 2.4 km and 38 km respectively high-order y  0 to 15 High-order part of the y coordinate of the coordinate tag expands the maximum coordinate values to approximately 2.4 km and 38 km respectively. CRC 16 A CRC of tag group data.

An active area is an area within which any captured input should be immediately forwarded to the corresponding hyperlabel server for interpretation. This also allows the hyperlabel server to signal to the user that the input has had an immediate effect. Since the server has access to precise region definitions, any active area indication in the surface coding can be imprecise so long as it is inclusive.

The width of the high-order coordinate fields, if non-zero, reduces the width of the signature field by a corresponding number of bits. Full coordinates are computed by prepending each high-order coordinate field to its corresponding coordinate field.

TABLE 2 Mapping of fields to codewords codeword field codeword bits field width bits A 12:0 x coordinate 13 all 12:9 data fragment  4 3:0 25:13 y coordinate 13 all 25:22 data fragment  4 7:4 26 active area flag  1 all 27 data fragment flag  1 all B  7:0 encoding format  8 all 15:8 region flags  8 all 23:16 tag size ID  8 all 39:24 CRC 16 all 43:40 high-order  4 3:0 coordinate width (w) C 35:0 signature 36 all (35-w):(36-2w) high-order x w all coordinate 35:(36-w) high-order y w all coordinate 43:36 region ID  8 7:0 D 43:0 region ID 44 51:8  E 43:0 region ID 44 95:52 Embedded Data

If the “region has embedded data” flag in the region flags is set then the surface coding contains embedded data. The data is encoded in multiple contiguous tags' data fragments, and is replicated in the surface coding as many times as it will fit.

The embedded data is encoded in such a way that a random and partial scan of the surface coding containing the embedded data can be sufficient to retrieve the entire data. The scanning system reassembles the data from retrieved fragments, and reports to the user when sufficient fragments have been retrieved without error.

As shown in Table 3, a 200-bit data block encodes 160 bits of data. The block data is encoded in the data fragments of a contiguous group of 25 tags arranged in a 5×5 square. A tag belongs to a block whose integer coordinate is the tag's coordinate divided by 5. Within each block the data is arranged into tags with increasing x coordinate within increasing y coordinate.

A data fragment may be missing from a block where an active area map is present. However, the missing data fragment is likely to be recoverable from another copy of the block.

Data of arbitrary size is encoded into a superblock consisting of a contiguous set of blocks arranged in a rectangle. The size of the superblock is encoded in each block. A block belongs to a superblock whose integer coordinate is the block's coordinate divided by the superblock size. Within each superblock the data is arranged into blocks with increasing x coordinate within increasing y coordinate.

The superblock is replicated in the surface coding as many times as it will fit, including partially along the edges of the surface coding.

The data encoded in the superblock may include more precise type information, more precise size information, and more extensive error detection and/or correction data.

TABLE 3 Embedded data block field width description data type 8 The type of the data in the superblock. Values include: 0: type is controlled by region flags 1: MIME Other values are TBA. superblock width 8 The width of the superblock, in blocks. superblock height 8 The height of the superblock, in blocks. data 160 The block data. CRC 16 A CRC of the block data. total 200

It will be appreciated that any form of embedded data may be used, including for example, text, image, audio, video data, such as product information, application data, contact data, business card data, and directory data.

Region Signatures

If the “region has signature” flag in the region flags is set then the signature field contains a signature with a maximum width of 36 bits. The signature is typically a random number associated with the region ID in a secure database. The signature is ideally generated using a truly random process, such as a quantum process, or by distilling randomness from random events.

In an online environment the signature can be validated, in conjunction with the region ID, by querying a server with access to the secure database.

If the “region has embedded data” and “embedded data is signature” flags in the region flags are set then the surface coding contains a 160-bit cryptographic signature of the region ID. The signature is encoded in a one-block superblock.

In an online environment any number of signature fragments can be used, in conjunction with the region ID and optionally the random signature, to validate the signature by querying a server with knowledge of the full signature or the corresponding private key.

In an offline (or online) environment the entire signature can be recovered by reading multiple tags, and can then be validated using the corresponding public signature key.

Signature verification is discussed in more detail below.

MIME Data

If the embedded data type is “MIME” then the superblock contains Multipurpose Internet Mail Extensions (MIME) data according to RFC 2045 (Freed, N., and N. Borenstein, “Multipurpose Internet Mail Extensions (MIME)—Part One: Format of Internet Message Bodies”, RFC 2045, November 1996), RFC 2046 (Freed, N., and N. Borenstein, “Multipurpose Internet Mail Extensions (MIME)—Part Two: Media Types”, RFC 2046, November 1996) and related RFCs. The MIME data consists of a header followed by a body. The header is encoded as a variable-length text string preceded by an 8-bit string length. The body is encoded as a variable-length type-specific octet stream preceded by a 16-bit size in big-endian format.

The basic top-level media types described in RFC 2046 include text, image, audio, video and application.

RFC 2425 (Howes, T., M. Smith and F. Dawson, “A MIME Content-Type for Directory Information”, RFC 2045, September 1998) and RFC 2426 (Dawson, F., and T. Howes, “vCard MIME Directory Profile”, RFC 2046, September 1998) describe a text subtype for directory information suitable, for example, for encoding contact information which might appear on a business card.

Encoding and Printing Considerations

The Print Engine Controller (PEC) (which is the subject of a number of pending U.S. patent application Ser. Nos. including: 09/575,108; 10/727,162; 09/575,110; 09/607,985; 6,398,332; 6,394,573; 6,622,923) supports the encoding of two fixed (per-page) 2⁴-ary (15,7) Reed-Solomon codewords and four variable (per-tag) 2⁴-ary (15,7) Reed-Solomon codewords, although other numbers of codewords can be used for different schemes.

Furthermore, PEC supports the rendering of tags via a rectangular unit cell whose layout is constant (per page) but whose variable codeword data may vary from one unit cell to the next. PEC does not allow unit cells to overlap in the direction of page movement.

A unit cell compatible with PEC contains a single tag group consisting of four tags. The tag group contains a single A codeword unique to the tag group but replicated four times within the tag group, and four unique B codewords. These can be encoded using five of PEC's six supported variable codewords. The tag group also contains eight fixed C and D codewords. One of these can be encoded using the remaining one of PEC's variable codewords, two more can be encoded using PEC's two fixed codewords, and the remaining five can be encoded and pre-rendered into the Tag Format Structure (TFS) supplied to PEC.

PEC imposes a limit of 32 unique bit addresses per TFS row. The contents of the unit cell respect this limit. PEC also imposes a limit of 384 on the width of the TFS. The contents of the unit cell respect this limit.

Note that for a reasonable page size, the number of variable coordinate bits in the A codeword is modest, making encoding via a lookup table tractable. Encoding of the B codeword via a lookup table may also be possible. Note that since a Reed-Solomon code is systematic, only the redundancy data needs to appear in the lookup table.

Imaging and Decoding Considerations

The minimum imaging field of view required to guarantee acquisition of an entire tag has a diameter of 39.6 s, i.e. (2×(12+2))√{square root over (2)}s allowing for arbitrary alignment between the surface coding and the field of view. Given a macrodot spacing of 143 μm, this gives a required field of view of 5.7 mm.

Table 4 gives pitch ranges achievable for the present surface coding for different sampling rates, assuming an image sensor size of 128 pixels.

TABLE 4 Pitch ranges achievable for present surface coding for different sampling rates, computed using Optimize Hyperlabel Optics; dot pitch = 1600 dpi, macrodot pitch = 9 dots, viewing distance = 30 mm, nib-to-FOV separation = 1 mm, image sensor size = 128 pixels sampling rate pitch range 2 −40 to +49 2.5 −27 to +36 3 −10 to +18

For the surface coding above, the decoding sequence is as follows:

-   -   locate targets of complete tag     -   infer perspective transform from targets     -   sample cyclic position code     -   decode cyclic position code     -   determine orientation from cyclic position code     -   sample and decode local Reed-Solomon codeword     -   determine tag x-y location     -   infer 3D tag transform from oriented targets     -   determine nib x-y location from tag x-y location and 3D         transform     -   determine active area status of nib location with reference to         active area map     -   generate local feedback based on nib active area status     -   determine tag type     -   sample distributed Reed-Solomon codewords (modulo window         alignment, with reference to tag type)     -   decode distributed Reed-Solomon codewords     -   verify tag group data CRC     -   on decode error flag bad region ID sample     -   determine encoding type, and reject unknown encoding     -   determine region flags     -   determine region ID     -   encode region ID, nib x-y location, nib active area status in         digital ink     -   route digital ink based on region flags

Region ID decoding need not occur at the same rate as position decoding and decoding of a codeword can be avoided if the codeword is found to be identical to an already-known good codeword.

If the high-order coordinate width is non-zero, then special care must be taken on boundaries between tags where the low-order x or y coordinate wraps, otherwise codeword errors may be introduced. If wrapping is detected from the low-order x or y coordinate (i.e. it contains all zero bits or all one bits), then the corresponding high-order coordinate can be adjusted before codeword decoding. In the absence of genuine symbol errors in the high-order coordinate, this will prevent the inadvertent introduction of codeword errors.

Alternative Tag Arrangements

It will be appreciated that a range of different tag layouts and tag structures can be utilised.

For example, the tag group shown in FIG. 9 can be replaced with the tag group shown in FIG. 16, in which the tags are not rotated relative to each other. FIG. 17 shows an arrangement that utilises a six-fold rotational symmetry at the physical level, with each diamond shape representing a respective symbol. FIG. 18 shows a version of the tag in which the tag is expanded to increase its data capacity by adding additional bands of symbols about its circumference.

The use of these alternative tag structures, including associated encoding considerations, is described shown in more detail in the copending patent application Ser. Nos. 10/409,864, 10/309,358, 10/410,484, and 10/786,631 the contents of which is incorporated herein by cross reference.

Security Discussion

As described above, authentication relies on verifying the correspondence between data and a signature of that data. The greater the difficulty in forging a signature, the greater the trustworthiness of signature-based authentication.

The item ID is unique and therefore provides a basis for a signature. If online authentication access is assumed, then the signature may simply be a random number associated with the item ID in an authentication database accessible to the trusted online authenticator. The random number may be generated by any suitable method, such as via a deterministic (pseudo-random) algorithm, or via a stochastic physical process. A keyed hash or encrypted hash may be preferable to a random number since it requires no additional space in the authentication database. However, a random signature of the same length as a keyed signature is more secure than the keyed signature since it is not susceptible to key attacks. Equivalently, a shorter random signature confers the same security as a longer keyed signature.

In the limit case no signature is actually required, since the mere presence of the item ID in the database indicates authenticity. However, the use of a signature limits a forger to forging items he has actually sighted.

To prevent forgery of a signature for an unsighted ID, the signature must be large enough to make exhaustive search via repeated accesses to the online authenticator intractable. If the signature is generated using a key rather than randomly, then its length must also be large enough to prevent the forger from deducing the key from known ID-signature pairs. Signatures of a few hundred bits are considered secure, whether generated using private or secret keys.

While it may be practical to include a reasonably secure random signature in a tag (or local tag group), particularly if the length of the ID is reduced to provide more space for the signature, it may be impractical to include a secure ID-derived signature in a tag. To support a secure ID-derived signature, we can instead distribute fragments of the signature across multiple tags. If each fragment can be verified in isolation against the ID, then the goal of supporting authentication without increasing the sensing device field of view is achieved. The security of the signature can still derive from the full length of the signature rather than from the length of a fragment, since a forger cannot predict which fragment a user will randomly choose to verify. A trusted authenticator can always perform fragment verification since they have access to the key and/or the full stored signature, so fragment verification is always possible when online access to a trusted authenticator is available.

Fragment verification requires that we prevent brute force attacks on individual fragments, otherwise a forger can determine the entire signature by attacking each fragment in turn. A brute force attack can be prevented by throttling the authenticator on a per-ID basis. However, if fragments are short, then extreme throttling is required. As an alternative to throttling the authenticator, the authenticator can instead enforce a limit on the number of verification requests it is willing to respond to for a given fragment number. Even if the limit is made quite small, it is unlikely that a normal user will exhaust it for a given fragment, since there will be many fragments available and the actual fragment chosen by the user can vary. Even a limit of one can be practical. More generally, the limit should be proportional to the size of the fragment, i.e. the smaller the fragment the smaller the limit. Thus the experience of the user would be somewhat invariant of fragment size. Both throttling and enforcing fragment verification limits imply serialisation of requests to the authenticator. Enforcing fragment verification limits further requires the authenticator to maintain a per-fragment count of satisfied verification requests.

A brute force attack can also be prevented by concatenating the fragment with a random signature encoded in the tag. While the random signature can be thought of as protecting the fragment, the fragment can also be thought of as simply increasing the length of the random signature and hence increasing its security.

Fragment verification may be made more secure by requiring the verification of a minimum number of fragments simultaneously.

Fragment verification requires fragment identification. Fragments may be explicitly numbered, or may more economically be identified by the two-dimensional coordinate of their tag, modulo the repetition of the signature across a continuous tiling of tags.

The limited length of the ID itself introduces a further vulnerability. Ideally it should be at least a few hundred bits. In the Netpage surface coding scheme it is 96 bits or less. To overcome this the ID may be padded. For this to be effective the padding must be variable, i.e. it must vary from one ID to the next. Ideally the padding is simply a random number, and must then be stored in the authentication database indexed by ID. If the padding is deterministically generated from the ID then it is worthless.

Offline authentication of secret-key signatures requires the use of a trusted offline authentication device. The QA chip (which is the subject of a number of pending U.S. patent application Ser. Nos. including 09/112,763; 09/112,762; 09/112,737; 09/112,761; 09/113,223) provides the basis for such a device, although of limited capacity. The QA chip can be programmed to verify a signature using a secret key securely held in its internal memory. In this scenario, however, it is impractical to support per-ID padding, and it is impractical even to support more than a very few secret keys. Furthermore, a QA chip programmed in this manner is susceptible to a chosen-message attack. These constraints limit the applicability of a QA-chip-based trusted offline authentication device to niche applications.

In general, despite the claimed security of any particular trusted offline authentication device, creators of secure items are likely to be reluctant to entrust their secret signature keys to such devices, and this is again likely to limit the applicability of such devices to niche applications.

By contrast, offline authentication of public-key signatures (i.e. generated using the corresponding private keys) is highly practical. An offline authentication device utilising public keys can trivially hold any number of public keys, and may be designed to retrieve additional public keys on demand, via a transient online connection, when it encounters an ID for which it knows it has no corresponding public signature key. Untrusted offline authentication is likely to be attractive to most creators of secure items, since they are able to retain exclusive control of their private signature keys.

A disadvantage of offline authentication of a public-key signature is that the entire signature must be acquired from the coding, violating our desire to support authentication with a minimal field of view. A corresponding advantage of offline authentication of a public-key signature is that access to the ID padding is no longer required, since decryption of the signature using the public signature key generates both the ID and its padding, and the padding can then be ignored. A forger can not take advantage of the fact that the padding is ignored during offline authentication, since the padding is not ignored during online authentication.

Acquisition of an entire distributed signature is not particularly onerous. Any random or linear swipe of a hand-held sensing device across a coded surface allows it to quickly acquire all of the fragments of the signature. The sensing device can easily be programmed to signal the user when it has acquired a full set of fragments and has completed authentication. A scanning laser can also easily acquire all of the fragments of the signature. Both kinds of devices may be programmed to only perform authentication when the tags indicate the presence of a signature.

Note that a public-key signature may be authenticated online via any of its fragments in the same way as any signature, whether generated randomly or using a secret key. The trusted online authenticator may generate the signature on demand using the private key and ID padding, or may store the signature explicitly in the authentication database. The latter approach obviates the need to store the ID padding.

Note also that signature-based authentication may be used in place of fragment-based authentication even when online access to a trusted authenticator is available.

Table 5 provides a summary of which signature schemes are workable in light of the foregoing discussion.

TABLE 5 Summary of workable signature schemes encoding acquisition signature online offline in tags from tags generation authentication authentication Local full random ok Impractical to store per ID information secret key Signature too Undesirable to short to be store secret secure keys private key Signature too short to be secure Distributed fragment(s) random ok impractical^(b) secret key ok impractical^(c) private key ok impractical^(b) full random ok impractical^(b) secret key ok impractical^(c) private key ok ok Security Specification

FIG. 19 shows an example item signature object model.

An item has an ID (X) and other details (not shown). It optionally has a secret signature (Z). It also optionally has a public-key signature. The public-key signature records the signature (S) explicitly, and/or records the padding (P) used in conjunction with the ID to generate the signature. The public-key signature has an associated public-private key pair (K, L). The key pair is associated with a one or more ranges of item IDs.

Typically issuers of security documents and pharmaceuticals will utilise a range of IDs to identify a range of documents or the like. Following this, the issuer will then use these details to generate respective IDs for each item, or document to be marked.

Authentication of the product can then be performed online or offline by sensing the tag data encoded within the tag, and performing the authentication using a number of different mechanisms depending on the situation.

Examples of the processes involved will now be described for public and private key encryption respectively.

Authentication Based on Public-Key Signature

Setup Per ID Range:

-   -   generate public-private signature key pair (K, L)     -   store key pair (K, L) indexed by ID range         Setup Per ID:     -   generate ID padding (P)     -   retrieve private signature key (L) by ID (X)     -   generate signature (S) by encrypting ID (X) and padding (P)         using private key (L):         S←E _(L)(X,P)     -   store signature (S) in database indexed by ID (X) (and/or store         padding (P))     -   encode ID (X) in all tag groups     -   encode signature (S) across multiple tags in repeated fashion         Online Fragment-Based Authentication (User):     -   acquire ID (X) from tags     -   acquire position (x, y)_(i) and signature fragment (T_(i)) from         tag     -   generate fragment number (i) from position (x, y)_(i):         i←F[(x,y)_(i)]     -   look up trusted authenticator by ID (X)     -   transmit ID (X), fragment (S_(i)) and fragment number (i) to         trusted authenticator         Online Fragment-Based Authentication (Trusted Authenticator):     -   receive ID (X), fragment (S_(i)) and fragment number (i) from         user     -   retrieve signature (S) from database by ID (X) (or re-generate         signature)     -   compare received fragment (T_(i)) with corresponding fragment of         signature (S_(i))     -   report authentication result to user         Offline Signature-Based Authentication (User):     -   acquire ID from tags (X)     -   acquire positions (x, y)_(i) and signature fragments (T_(i))         from tag     -   generate fragment numbers (i) from positions (x, y)_(i):         i←F[(x,y)_(i)]         S←S ₀ |S ₁ | . . . S _(n-1)     -   generate signature (S) from (n) fragments:     -   retrieve public signature key (K) by ID (X)     -   decrypt signature (S) using public key (K) to obtain ID (X′) and         padding (P′):         x′|P′←D _(K)(S)     -   compare acquired ID (X) with decrypted ID (X′)     -   report authentication result to user         Authentication Based on Secret-Key Signature         Setup Per ID:     -   generate secret (Z)     -   store secret (Z) in database indexed by ID (X)     -   encode ID (X) and secret (Z) in all tag groups         Online Secret-Based Authentication (User):     -   acquire ID (X) from tags     -   acquire secret (Z′) from tags     -   look up trusted authenticator by ID     -   transmit ID (X) and secret (Z′) to trusted authenticator         Online Secret-Based Authentication (Trusted Authenticator):     -   receive ID (X) and secret (Z′) from user     -   retrieve secret (Z) from database by ID (X)     -   compared received secret (Z′) with secret (Z)     -   report authentication result to user

As discussed earlier, secret-based authentication may be used in conjunction with fragment-based authentication.

Cryptographic Algorithms

When the public-key signature is authenticated offline, the user's authentication device typically does not have access to the padding used when the signature was originally generated. The signature verification step must therefore decrypt the signature to allow the authentication device to compare the ID in the signature with the ID acquired from the tags. This precludes the use of algorithms which don't perform the signature verification step by decrypting the signature, such as the standard Digital Signature Algorithm U.S. Department of Commerce/National Institute of Standards and Technology, Digital Signature Standard (DSS), FIPS 186-2, 27 Jan. 2000.

RSA encryption is described in:

-   Rivest, R. L., A. Shamir, and L. Adleman, “A Method for Obtaining     Digital Signatures and Public-Key Cryptosystems”, Communications of     the ACM, Vol. 21, No. 2, February 1978, pp. 120-126 -   Rivest, R. L., A. Shamir, and L. M. Adleman, “Cryptographic     communications system and method”, U.S. Pat. No. 4,405,829, issued     20 Sep. 1983 -   RSA Laboratories, PKCS #1 v2.0: RSA Encryption Standard, Oct. 1,     1998

RSA provides a suitable public-key digital signature algorithm that decrypts the signature. RSA provides the basis for the ANSI X9.31 digital signature standard American National Standards Institute, ANSI X9.31-1998, Digital Signatures Using Reversible Public Key Cryptography for the Financial Services Industry (rDSA), Sep. 8, 1998. If no padding is used, then any public-key signature algorithm can be used.

In the hyperlabel surface coding scheme the ID is 96 bits long or less. It is padded to 160 bits prior to being signed.

The padding is ideally generated using a truly random process, such as a quantum process [14,15], or by distilling randomness from random events Schneier, B., Applied Cryptography, Second Edition, John Wiley & Sons 1996.

In the hyperlabel surface coding scheme the random signature, or secret, is 36 bits long or less. It is also ideally generated using a truly random process.

Security Tagging and Tracking

Currency, checks and other monetary documents can be tagged in order to detect currency counterfeiting and counter money laundering activities. The Hyperlabel tagged currency can be validated, and tracked through the monetary system. Hyperlabel tagged products such as pharmaceuticals can be tagged allowing items to be validated and tracked through the distribution and retail system.

A number of examples of the concepts of Hyperlabel security tagging and tracking referring specifically to bank notes and pharmaceuticals, however Hyperlabel tagging can equally be used to securely tag and track other products, for example, traveller's checks, demand deposits, passports, chemicals etc.

Hyperlabel tagging, with the Netpage system, provides a mechanism for securely validating and tracking objects.

Hyperlabel tags on the surface of an object uniquely identify the object. Each Hyperlabel tag contains information including the object's unique ID, and the tag's location on the Hyperlabel tagged surface. A Hyperlabel tag also contains a signature fragment which can be used to authenticate the object. A scanning laser or image sensor can read the tags on any part of the object to identify the object, validate the object, and allow tracking of the object.

Currency Tagging

An example of the protection of security documents will now be described with reference to the specific protection of currency, such as bank notes, although it will be appreciated that the techniques may be applied to any security document.

Currency may be tagged with Hyperlabels in order to detect counterfeiting and allow tracking of currency movement. Hyperlabel tags can be printed over the entire bank note surface or can be printed in a smaller region of the note. Hyperlabel tagging can be used in addition to other security features such as holograms, foil strips, colour-shifting inks etc. A scanning laser or image sensor can read the tags on any part of the note to validate each individual note.

In this example, each hexagonal Hyperlabel currency tag is around 2.5 mm across, and incorporates a variety of data in the form of printed dots of infrared ink. An example of a tag included on a bank note is shown in FIG. 20.

A Hyperlabel currency tag identifies the note currency, issue country, and note denomination. It also identifies the note's serial number, the note side (i.e. front or back), and it may contain other information (for example, the exact printing works where the note was printed). There are two note IDs for each physical bank note—one for each side of the note.

The tag may also include:

-   -   Alignment marks (these are the larger dots in the image above)     -   A code indicating that the tag is a currency tag, as opposed to         a commercial Hyperlabel or Hyperlabel tag     -   A horizontal position code, specifying where the tag is along         the note     -   A vertical position code, specifying where the tag is across the         note     -   A cryptographic signature     -   Error detection and correction bits

Each tag is unique. That is, of all tags ever to be printed on any note or other document, no two valid tags will ever be the same. The tags are designed to be easily read with low cost scanners that can be built into a variety of validation devices.

Hyperlabel currency tags can be read by any Hyperlabel scanner. These scanners can be incorporated into a variety of devices to facilitate authentication and tracking, as will be described in more detail below.

Tracking

For the purpose of tracking and item validation the manufacturer, or other central authority, maintains a database which tracks the location and status of all currency. This can also be used in authentication of currency.

Each time a note is scanned its location is recorded. This location information can be collected in a central database allowing analysis and identification of abnormal money movements and detection of counterfeit notes. This allows the creation of highly accurate intelligence about criminal activity and the real-time detection of the location of stolen or counterfeit notes at many locations within the monetary system. For example, in the case of sophisticated forgeries where Hyperlabel dot patterns are exactly duplicated, there will be multiple copies of exactly forged notes (at a minimum, the original and the forgery). If multiple identical notes appear in different places at the same time, all but one of the notes must be a forgery. All can then be treated as suspect.

Thus, when a transaction is performed using currency, the general process is as follows:

-   -   a transaction is agreed     -   currency is provided relating to the transaction     -   the currency is scanned using an appropriate sensing device     -   the sensing device sense at least one tag and generates         predetermined data     -   the predetermined data is transferred to a central government         database

In this regard, the following predetermined data is automatically sent from the scanners to the central government currency database:

-   -   The serial number of the note     -   The denomination of the note     -   Note validity data     -   The serial number of the scanner     -   The time and date of the scan     -   The physical location of the scanner at the time the scan was         taken (for fixed scanners this is automatic, and for mobile         scanners the physical location is determined using a GPS         tracker)     -   The network location of the scanner     -   The identity of the person making reportable cash transactions

Thus, Hyperlabel technology makes it possible to build databases containing the serial number and history of all notes issued, and it allows them to be tracked through the monetary system. The data collected can be used to build up cash flow maps based on the validation data received, and its presence will provide a powerful tool for law enforcement agencies to combat theft, money laundering and counterfeiting in the global economy.

With each note being tracked over its lifetime, from when it is first printed, until it is destroyed. Calculations show that this database will need to store in excess of 50 GBytes per day to track all US Dollar movements. Similar storage is also required for the Euro. This is well within the capabilities of modern database systems.

There are also a large number of transactions involved—several hundred million per day. These are within the capability of conventional distributed transaction processing systems. However, the Hyperlabel currency system can be implemented at substantially lower cost by using new generation database systems that perform transactions in semiconductor memory, instead of disk drives. These transactions can then be continually streamed to disk as a background ‘backup’ task. Such systems are likely to be sufficiently mature by the time that a Hyperlabel based currency tracking system comes on-line that they will be a viable choice.

As well as basic tracking and validation functions, the database system may have the following additional features:

-   -   Indication of abnormal money movement patterns within the system         (e.g. large cash payments made at different locations within the         system by persons of interest)     -   The provision of cash flow demand forecasts     -   Data mining features that could be used to detect and prosecute         counterfeiters and money launderers     -   Neural network based fraud detection     -   Geographic trends identification

Thus, the central database maintains up-to-date information on valid object IDs, an object ID hotlist (for all suspect object IDs), and a list of public keys corresponding to object IDs. The central server also maintains an object scanning history to track an object's movements. Each time an object is scanned, its timestamped location is recorded. If known, the details of the object owner may also be recorded. This information may be known particularly in the case of large financial transactions e.g. a large cash withdrawal from a bank. This object scanning history data can be used to detect illegal product movements, for example, the illegal import of currency. It can also be used to detect abnormal or suspicious product movements which may be indicative of product counterfeiting.

If an object is known to be stolen it can be immediately added to an object ID hotlist on the central server. This hotlist is automatically distributed to (or becomes accessible to) all on-line scanners, and will be downloaded to all off-line scanners on their next update. In this way the stolen status is automatically and rapidly disseminated to a huge number of outlets. Similarly, if an object is in any other way suspect it can be added to the hotlist so that its status is flagged to the person scanning the object.

An on-line scanner has instant access to the central server to allow checking of each object ID at the time of scanning. The object scanning history is also updated at the central server at the time the object is scanned.

An off-line scanner stores object status data internally to allow validation of a scanned object. The object status data includes valid ID range lists, an object ID hotlist, a public key list, and an object scanning history. Each time an object is scanned the details are recorded in the object scanning history. The object status data is downloaded from the central server, and the object scanning history is uploaded to the central server, each time the scanner connects.

A mobile scanner's location can be provided to the application by the scanner, if it is GPS-equipped. Alternatively the scanner's location can be provided by the network through which it communicates.

For example, if the hand-held scanner uses the mobile phone network, the scanner's location can be provided by the mobile phone network provider. There are a number of location technologies available. One is Assisted Global Positioning System (A-GPS). This requires a GPS-equipped handset, which receives positioning signals from GPS satellites. The phone network knows the approximate location of the handset (in this case the handset is also the scanner) from the nearest cell site. Based on this, the network tells the handset which GPS satellites to use in its position calculations. Another technology, which does not require the device to be GPS-equipped, is Uplink Time Difference of Arrival (U-TDOA). This determines the location of a wireless handset, using a form of triangulation, by comparing the time it takes a wireless handset's signal to reach several Location Measurement Units (LMUs) installed at the network's cell sites. The handset location is then calculated based on the differences in arrival times of the three (or more) signals.

Authentication

Each object ID has a signature. Limited space within the Hyperlabel tag structure makes it impractical to include a full cryptographic signature in a tag so signature fragments are distributed across multiple tags. A smaller random signature, or secret, can be included in a tag.

To avoid any vulnerability due to the limited length of the object ID, the object ID is padded, ideally with a random number. The padding is stored in an authentication database indexed by object ID. The authentication database may be managed by the manufacturer, or it may be managed by a third-party trusted authenticator.

Each Hyperlabel tag contains a signature fragment and each fragment (or a subset of fragments) can be verified, in isolation, against the object ID. The security of the signature still derives from the full length of the signature rather than from the length of the fragment, since a forger cannot predict which fragment a user will randomly choose to verify.

Fragment verification requires fragment identification. Fragments may be explicitly numbered, or may by identified by the two-dimensional coordinate of their tag, modulo the repetition of the signature across continuous tiling of tags.

Note that a trusted authenticator can always perform fragment verification, so fragment verification is always possible when on-line access to a trusted authenticator is available.

Establishing Authentication Database

Prior to allocating a new range of IDs, some setup tasks are required to establish the authentication database.

For each range of IDs a public-private signature key pair is generated and the key pair is stored in the authentication database, indexed by ID range.

For each object ID in the range the following setup is required:

-   -   generate ID padding and store in authentication database,         indexed by object ID     -   retrieve private signature key by object ID     -   generate signature by encrypting object ID and padding, using         private key     -   store signature in authentication database indexed by object ID,         and/or store the padding, since the signature can be         re-generated using the ID, padding and private key     -   encode the signature across multiple tags in repeated fashion

This data is required for the Hyperlabel tags therefore the authentication database must be established prior to, or at the time of, printing of the Hyperlabels.

Security issues are discussed in more detail above.

FIG. 21 summarises note printing and distribution of notes with Hyperlabel tags. Notes are also logged in the database whenever they are scanned in circulation, and also when they are destroyed.

While the technology to print commercial Hyperlabel tags will be commercially available, only the authorized currency printing bureaus of a government will be able to print the codes corresponding to that government's currency. These codes are protected by 2048 bit RSA cryptography embedded within the integrated circuits (chips) embedded in the Memjet™ printers used to print Hyperlabel tags. This is a highly secure form of asymmetric cryptography, using private and public keys. The private keys relating to any particular currency would be kept only by authorised national security agencies.

Off-Line Public-Key-Based Authentication

An off-line authentication device utilises public-key signatures. The authentication device holds a number of public keys. The device may, optionally, retrieve additional public keys on demand, via a transient on-line connection when it encounters an object ID for which it has no corresponding public key signature.

For off-line authentication, the entire signature is needed. The authentication device is swiped over the Hyperlabel tagged surface and a number of tags are read. From this, the object ID is acquired, as well as a number of signature fragments and their positions. The signature is then generated from these signature fragments. The public key is looked up, from the scanning device using the object ID. The signature is then decrypted using the public key, to give an object ID and padding. If the object ID obtained from the signature matches the object ID in the Hyperlabel tag then the object is considered authentic.

The off-line authentication method can also be used on-line, with the trusted authenticator playing the role of authenticator.

On-Line Public-Key-Based Authentication

An on-line authentication device uses a trusted authenticator to verify the authenticity of an object. For on-line authentication a single tag can be all that is required to perform authentication. The authentication device scans the object and acquires one or more tags. From this, the object ID is acquired, as well as at least one signature fragment and its position. The fragment number is generated from the fragment position. The appropriate trusted authenticator is looked up by the object ID. The object ID, signature fragment, and fragment number are sent to the trusted authenticator.

The trusted authenticator receives the data and retrieves the signature from the authentication database by object ID. This signature is compared with the supplied fragment, and the authentication result is reported to the user.

On-Line Secret-Based Authentication

Alternatively or additionally, if a random signature or secret is included in each tag (or tag group), then this can be verified with reference to a copy of the secret accessible to a trusted authenticator. Database setup then includes allocating a secret for each object, and storing it in the authentication database, indexed by object ID.

The authentication device scans the object and acquires one or more tags. From this, the object ID is acquired, as well as the secret. The appropriate trusted authenticator is looked up by the object ID. The object ID and secret are sent to the trusted authenticator.

The trusted authenticator receives the data and retrieves the secret from the authentication database by object ID. This secret is compared with the supplied secret, and the authentication result is reported to the user.

Secret-based authentication can be used in conjunction with on-line fragment-based authentication is discussed in more detail above.

Product Scanning Interactions

Product Scanning at a retailer is illustrated in FIG. 22. When a store operator scans a Hyperlabel tagged product the tag data is sent to the service terminal (A). The service terminal sends the transaction data to the store server (B). The store server sends this data, along with the retailer details, to the manufacturer server (C). The Hyperlabel server knows which manufacturer server to send the message to from the object ID. On receipt of the input, the manufacturer server authenticates the object, if the manufacturer is the trusted authenticator. Alternatively the manufacturer server passes the data on to the authentication server to verify the object ID and signature (D). The authentication server sends the authentication result back to the manufacturer server (E). The manufacturer server checks the status of the object ID (against its valid ID lists and hotlist), and sends the response to the store server (F), which in turn send the result back the store service terminal (G). The store server could also communicate with the relevant authentication server directly.

The interaction detail for on-line product scanning at a retailer is shown in FIG. 23. The store operator scans the Hyperlabel tagged product. The scanner sends the scanner ID and tag data to the service terminal. The service terminal sends this data along with the terminal ID and scanner location to the store server. The store server then sends the request on to the manufacturer server, which performs authentication (either itself or via a third party authentication server) and determines the object status. The response is then sent back to the store server, and on to the operator service terminal.

The interaction detail for off-line product scanning at a retailer is shown in FIG. 24. The store operator scans the Hyperlabel tagged product. The scanner sends the scanner ID and tag data from multiple tags to the service terminal. The service terminal sends this data, along with the terminal ID and scanner location, to the store server. The store server then performs off-line authentication, as described in Section 3.4.2, and determines the object status through its cached hotlist, valid object ID lists, and public key list. The store server records the scan details in its internal object scanning history. The response is then sent back to the operator service terminal.

An alternative for off-line product scanner occurs where the scanner is a hand-held, stand-alone scanner. In this case the cached authentication data is stored within the scanner itself, and the scanner performs the validation internally. The object scanning history is also cached within the scanner. Periodically the scanner connects to the central database, uploads it's object scanning history, and downloads the latest public key list, object ID hotlist and valid ID range list. This connection may be automatic (and invisible to the user), or may be initiated by the user, for example, when the scanner is placed in a docking station/charger.

Product scanning with a Netpage pen is illustrated in FIG. 25. When a user scans a Hyperlabel tagged item with their Netpage pen, the input is sent to the Netpage System, from the user's Netpage pen, in the usual way (A). To scan a product rather than interact with it, the pen can be placed in a special mode. This is typically a one-shot mode, and can be initiated by tapping on a <scan> button printed on a Netpage. Alternatively, the pen can have a user-operable button, which, when held down during a tap or swipe, tells the pen to treat the interaction as a product scan rather than a normal interaction. The tag data is transmitted from the pen to the user's Netpage base station. The Netpage base station may be the user's mobile phone or PDA, or it may be some other Netpage device, such as a PC. The input is relayed to the Hyperlabel server (B) and then on to manufacturer server (C) in the usual way. On receipt of the input, the manufacturer server authenticates the object if the manufacturer is the trusted authenticator. Alternatively the manufacturer server passes the data on to the authentication server to verify the object ID and signature (D). The authentication server sends the authentication result back to the manufacturer server (E). The manufacturer server checks the status of the object ID (against its valid ID lists and hotlist), and sends the response to the Hyperlabel server (G). The Hyperlabel server, as part of the Netpage system, can know the identity and devices of the user. The Hyperlabel server will relay the manufacturer server's response to the user's phone (G) or Web browsing device (H) as appropriate. If the user's Netpage pen has LEDs then the Hyperlabel server can send a command to the user's pen to light the appropriate LED(s) (I,J).

The interaction detail for scanning with a Netpage pen is shown in FIG. 26. The Netpage pen clicks on the Hyperlabel tagged product. The Netpage pen sends the pen id, the product's tag data and the pen's location to the Hyperlabel server. If the pen ID is not already associated with a scanner, the Hyperlabel server may create a new scanner record for the pen, or may use the pen ID as a scanner ID. The Hyperlabel server sends the scanner ID, tag data, and scanner location (if known) to the manufacturer server, which performs authentication (either itself or via a third party authentication server) and determines the object status. The response is then sent back to the Hyperlabel server, and on to the user's default Web browsing device.

Security Tagging and Tracking Object Model

The Security Tagging and Tracking object model revolves around Hyperlabel tags, object IDs, and signatures. FIG. 36 illustrates the management and organisation of these objects.

As shown in FIG. 27, a Hyperlabel tag comprises a tag type, object ID, two-dimensional position and a signature fragment. The tag type indicates whether this is a tag on a common object, or whether the tag is on a special type of object such as a currency note or a pharmaceutical product. A signature fragment has an optional fragment number which identifies the fragment's place within the full signature.

Currency notes are identified by a note ID. The note ID comprises note data and a serial number. The note data identifies the type of currency, the country of issue, the note denomination, the note side (front or back) and other currency-specific information. There are two note IDs for each physical bank note—one for each side of the printed note. The Note ID class diagram is shown in FIG. 28.

Object Description, ownership and aggregation class diagram is shown in FIG. 29. This is described in more detail above.

The Object Scanning History class diagram is shown in FIG. 30. An object has an object scanning history, recording each time the scanner scans an object. Each object scanned event comprises the scanner ID, the date and time of the scan, and the object status at the time of the scan, and the location of the scanner at the time the object was scanned. The object status may be valid, stolen, counterfeit suspected, etc. If known, the object owner details may also be recorded.

A scanner has a unique scanner ID, a network address, owner information and a status (e.g. on-line, off-line). A scanner is either a mobile scanner, whose location may vary, or a fixed scanner, whose location is known and constant. A scanner has a current location, comprising the location details and a timestamp. A scanner may be a Netpage pen, in which case it will be associated with a Netpage Pen record. If a scanner in off-line, it will keep an object scanning history, and will optionally store a public key list, a valid ID range list and an object ID hotlist. The scanner class diagram is shown in FIG. 31.

The manufacturer, or other central authority, maintains a number of Object ID Hot Lists, each with a unique list ID, and the time the list was last updated. Each hot list comprises a list of suspect object IDs, comprising the object ID, date, time, status (suspected counterfeit, stolen, etc.) and other information. The Object ID Hot List class diagram is shown in FIG. 32.

The manufacturer, or other central authority, maintains a list of valid ID ranges. Each valid object ID range entry in the list comprises the start object ID and end object ID (the valid ID range) and the time the entry was updated. The Valid ID Range List class diagram is shown in FIG. 33.

The manufacturer, or other central authority, maintains a public key list. The public key list consists of a number of entries identifying the public key for a range of Object IDs. Each valid object ID range entry comprises the update time for the entry, the start object ID for the range, the end object ID for the range, and the public key applicable to each object ID in the given range. The Public Key List class diagram is shown in FIG. 34.

Object authentication may be performed by the manufacturer, or by a third-party trusted authenticator. A trusted authenticator has an authenticator ID, name and details. A trusted authenticator holds a list of public-private key pairs, each associated with one or more ID ranges. This is a list of object ID ranges (identified by the start and end ID) and the corresponding public/private signature key pair. A trusted authenticator also holds a list of secret signatures, and a list of public-key signatures. Each public-key signature identifies the actual signature and/or the padding used to generate the signature. Each secret signature and public-key signature is associated by object ID with a unique object. The Trusted Authenticator class diagram is shown in FIG. 35.

Security Document Scanners

Hyperlabel scanners can be built into a variety of devices. Scanners may be fixed or mobile. A fixed scanner has a permanent, known location. A mobile scanner has no fixed location. A scanner may be on-line, i.e. have immediate access to the central database, or it may be off-line.

Hyperlabel scanners can determine both the validity and the value of currency. Their determination of a note's validity is more definite and more secure than current methods, and can be implemented at lower cost.

Scanners may be specific to a particular product application, such as a currency counter, or may be a generic Hyperlabel scanner. Hyperlabel scanners may be embedded in other multi-function devices, for example, a mobile phone or PDA. Such scanners are multi-purpose since they can also be used to scan Hyperlabel tagged consumer goods and printed materials. A small hand-held scanner may also be used to scan and validate currency. When a scanner scans a note it notifies the currency server of the note details, the current date and time, and the scanner location (if known). Optionally the scanner may also send the identity of the person making the cash transaction, if known. This information would be available in respect of bank transactions, currency exchanges and large cash transactions.

Accordingly, hyperlabel currency tags can be read using many types of device, including:

-   -   Currency counters     -   Automated teller machines     -   Cash registers     -   POS checkouts     -   Mobile phone with inbuilt scanner     -   Hyperlabel pens     -   Vending machines

The Hyperlabel technology used in these devices can be implemented in a wide range of applications. As a result, the development and deployment costs can be shared by the key stakeholders. Of the seven types of scanner listed, only the currency counters and vending machines are specific to currency. The other five are also used for scanning consumer goods and printed materials.

Hyperlabel scanners built into a variety of products will include the following features, currently under development at Silverbrook Research.

-   -   An infrared image sensor to read the Hyperlabel tags that         uniquely identify each note.     -   A 32 bit RISC processor with 20 megabits of secure code space         signed using 2048 bit RSA cryptography.     -   A highly secure processor with cryptographic and physical         security features for verifying the cryptographic signature on         Hyperlabel tags (under development at Silverbrook Research).     -   Infrared optics, including filters tuned to the Hyperlabel ink         infrared spectrum.     -   A real-time clock to verify the time of each transaction         reported.     -   Software to decode the Hyperlabel tags, record the details of         each scan, to validate each note scanned, and to facilitate         automatic and secure communications with an online database.     -   Communications systems to create secure network connections to         the central currency verification database.

Various of the Hyperlabel scanners described below are also planned to include the following units:

-   -   An inbuilt display and data entry mechanism to indicate to the         operator the amount of money counted, notes that are suspected         of being counterfeit, and the identity of the person requesting         reportable cash transactions.     -   A cache of the serial numbers of all known counterfeit and         stolen notes.     -   Other spectral filters tuned to the secure currency ink spectrum         (which differs from the commercially available Hyperlabel ink).     -   A GPS tracker to verify the location of the currency counter at         the time of use.         Currency Counters

A Hyperlabel currency counter with an inbuilt infrared scanner can be used to automatically scan, validate, and log each note in the central currency database as it is counted. An example of the implementation of this is shown in FIG. 37.

These units could replace existing currency counting machines now in use in banks, in foreign exchange offices, in bill payment agencies accepting cash payments, and in immigration offices at international airports.

As a currency scanner has no other obvious application other than currency. It does not need to communicate with any database other than the government currency database. A currency scanner may operate at high speed, requiring excess dataline bandwidth and transaction processing. To overcome this, the banknote validity data can be locally cached, and updated whenever it changes. Information on scanned notes is sent periodically in an encrypted form. Although the banknote location updates may be sent periodically security and timeliness for detection are not compromised. This is because data on any counterfeit or stolen notes could be sent immediately. The time of the scan is locally determined and accurately included in the data packet, and the list of counterfeit and stolen notes is updated as soon as the information is available.

Automated Teller Machines

An Automatic Teller Machine (ATM) is a relatively simple case, as it is typically not used for depositing cash, only dispensing it. Accordingly, they are not required to validate the notes. Notes can be validated and logged using a currency counter when they are placed into the ATM.

ATMs can be equipped with Hyperlabel scanners, which register notes as they are loaded into, as well as taken out of, the ATM. As well as providing currency tracking features, this will also reduce theft of, and from, ATMs. This is because the money taken from the ATM will be tracked, and as soon as the theft is reported, the money will be recorded in the central database as stolen.

Thus, as shown in FIG. 38, the ATM can track the details of the account from which the funds were withdrawn. This allows the particular notes dispensed to be logged as stolen if the real account holder notifies the bank of fraudulent transactions involving lost or stolen cards.

Cash Registers

Cash registers can have an add-on or built-in currency scanner for a small additional cost per unit. The notes are scanned as they are put into, or taken out of, the cash drawer. This also aids verification that the correct amount of money has been tendered, and the correct change given.

Tracking currency in and out of cash registers can enhance the safety of shop attendants. Once criminals become aware that stolen cash will be immediately recorded as stolen, then the incidence of theft should be significantly reduced.

As shown in FIG. 39, this is typically achieved by having the cash register communicate with a secure currency server, via a Hyperlabel server and a local shop database. Thus, the cash register can transfer information regarding transactions to the local database, which determines if local verification is sufficient, or if global validation or the like is required. Thus, for example, offline authentication may be used for transactions below a certain threshold required for

In this latter case, a request for verification or the like can be routed to the Hyperlabel server, which will then determine an associated secure currency, and route the request accordingly, allowing the secure currency server to perform authentication using the online

Hyperlabel Supermarket Checkout

One of the major applications of Hyperlabel is in consumer packaged goods, where it has the potential of being the ‘next generation bar code’ allowing automatic tracking of individual grocery items. This application requires automatic supermarket checkouts that scan products for Hyperlabels. These checkouts will be able to read currency Hyperlabel tags. This allows the currency to be tracked, but also simplifies payment, as the amount of money tendered is simply determined by passing it through the Hyperlabel scan field.

An example of a hyperlabel supermarket checkout is shown in FIG. 40, with examples being described in more detail in our copending application number [cross ref any application describing hyperlabel checkout], the contents of which is incorporated herein by cross reference.

Mobile Phone with Inbuilt Scanner

A mobile phone that has an inbuilt infrared scanner to scan and validate each note can be used in a range of locations where money counting is not a normal function. It is also used for other inventory management and validity checking applications, such as pharmaceutical security, forensic investigations, policing trademark infringement, and stocktaking, and is intended for wide distribution.

Tracking currency in and out of cash registers can enhance the safety of shop attendants as criminal activity should be affected by the realization that all notes taken from a cash register will be immediately registered as stolen, and that the criminal will run the risk of being caught just by using that cash in everyday transactions or by holding the cash.

Handheld Validity Scanner

Handheld Hyperlabel validity scanners may also be used where currency counters are not required or suitable. These devices are expected to be significantly more common than currency counters, as they have multiple uses, and will be much cheaper. An example of a handheld validity scanner is shown in FIG. 41, and described in more detail in copending application number [cross ref any application describing validity scanner], the contents of which is incorporated herein by cross reference.

An example of communications used in implementing a second example of a handheld scanner is shown in FIG. 42.

The validity scanner has multiple uses, including pharmaceutical security, brand-name security, stocktaking, forensic investigations, and policing. As it is not a dedicated currency device. It does not communicate directly with the government currency server as otherwise, large numbers of non-currency related messages would need to be routed through that server. Instead, it communicates directly with commercial Hyperlabel servers, and any currency related validation requests are passed on to the government server. To reduce the transaction load on the government server, note related information can be cached at the Hyperlabel server, much as they are cached in the currency counters.

The link to the database would typically be relayed over a radio link to allow local mobility. The radio link can be WiFi, GPRS, 3G mobile, Bluetooth, or other IP link, as appropriate. Internet transactions are secured using encrypted packets.

Hyperlabel Pen

The Hyperlabel pen is a miniature low cost scanner for consumer and business use. It uses an infrared image sensor, instead of a laser scanner, and scans a Hyperlabel tag whenever it is clicked against a surface.

Details of Hyperlabel pens are described for example in copending patent application number [cross ref any application describing pen], the contents of which are incorporated herein by cross reference.

These pens are intended for high volume consumer use, with intended distribution exceeding 100 million units. While its primary application is a wide range of ‘interactive paper’ and computer peripheral uses, it also allows consumers to verify Hyperlabel tags printed on currency, pharmaceuticals, and other objects. The Hyperlabel network will be managed by dedicated Hyperlabel servers, and any currency scans from Hyperlabel pens will be routed through these servers to a single logical connection to the Currency Servers. Because the costs are borne elsewhere, a huge number of currency validation and logging points can be added to the network at negligible incremental cost.

The pens do not have a display device, and are intended to be used in conjunction with a device with a display capability and a network connection, as shown in FIG. 43. As validation is a secondary function of the pens, they do not communicate directly with the currency database, and instead transfer requests via a relay device. Only a small fraction of pen hits (much less than 1%) are expected to be related to currency validation. The pens communicate by radio (typically Bluetooth) to the relay, which may be a computer, a mobile phone, a printer, or other computing device.

This relay device communicates, in turn, with the Hyperlabel server. If the Hyperlabel server determines that the pen has clicked on a currency tag, the click is interpreted as a validation query, which is then forwarded to the appropriate currency server. The currency server logs the identity and the network location of the pen that clicked on the note, as well as other data such as the note serial number, the time and the date. The physical location of the pen is typically unknown, as Hyperlabel pens usually do not include a GPS tracker. The currency server passes the validation message back to the Hyperlabel server, which formats the message for the display device that relayed the message from the pen.

Vending Machine

For a small additional cost, Hyperlabel scanners can also be added to vending machines to securely determine both the validity and the value of a note, as shown in FIG. 44. They also reduce the risk of currency theft from the vending machine. Vending machines are somewhat complimentary to ATMs—they accept notes, but do not dispense them.

Hyperlabel scanners send data to a remote secure server for storage and interpretation. A direct wireless or wired link can be established between the server and a scanner for communication. Alternatively, the scanners can communicate with the secure server indirectly through a companion device such as a point of sale (POS) terminal, a mobile phone, or computer. The database can be updated by scanners operating online in real-time, or periodically using batch file downloads. High speed scanners can cache lists of counterfeit and stolen notes locally, to reduce network traffic.

The validation messages can go directly to the currency server, or via the server of the company which owns and operates the vending machine. The vending machine can be configured to automatically reject any stolen or counterfeit notes. It is possible to display the status of the note (i.e. stolen or counterfeit) on most vending machines, and it is possible that this would act as a further crime deterrent—for even a humble vending machine can conspicuously identify dubious currency. It should only report this when the certainty is 100%. On lower certainties, it can simply reject the note without stating why, as is the current practice for vending machines.

Security Features

Hyperlabel currency security features include:

-   -   Notes can be tracked whenever they are scanned—at banks,         supermarket checkouts, vending machines, cash registers, and low         cost home scanners.     -   The unique range of currency tag numbers can be printed only by         the government printing agency.     -   Currency IR ink with unique spectral properties, can be made         available only to government printing agencies.     -   Note serial number printed in tag must match printed serial         number.     -   Tags are printed all over both sides of the note.     -   Tags vary across the note—a forger must match the thousands of         tags printed on any note.     -   Additional proprietary security features not disclosed in this         document.     -   The ability to determine both the validity and the value of         currency.         Security Requirements

For a low risk currency anti-forgery system, it is only necessary to make it uneconomic. That is, all that is required is that the cost of forging a note exceeds the face value of the note, taking into consideration likely advances in technology. A good system should also make it easy to detect and track counterfeiters and money launderers. The Hyperlabel system offers a practical solution that meets these objectives.

Table 6 outlines various levels of counterfeiting skill, and the corresponding ability of the Hyperlabel system to detect counterfeit currency.

TABLE 6 Scanner reports Counterfeit Counterfeiter Note probability of level characteristic characteristic counterfeit Photocopy Casual forger No Hyperlabel 100% certainty tags Hyperlabel Home forger, using Hyperlabel tags 100% certainty printer computers and are present, but printers they are not valid currency codes. Sophisti- Skilful forger who Tag serial number 100% certainty cated- creates a computer does not match computer system to generate a cryptographic systems sequence of signature in tag expert Hyperlabel tags Sophisti- No access to special Hyperlabel 100% certainty cated ink currency tags using currency printed with counters. Some commercial scanner types Hyperlabel IR ink (e.g. Hyperlabel instead of secure pens) do not currency IR ink detect the special ink High level Highly skilled forger Hyperlabel tags 100% certainty forgery who copies a tag do not vary from a note, and correctly over the replicates it across note the note using illegally obtained secure IR ink Perfect Conventional, highly 100,000 copies of 99.999% forgery skilled forger who an existing note certainty meticulously copies that are perfect in on any note, as every dot on the all respects, the 100,000 whole note, and including ink and forgeries cannot prints them with all-over pattern of be distinguished illegally obtained valid tags. All from the original secure IR ink 100,000 notes valid note. The have the same forgeries are serial number easily detected by humans due to repeating serial numbers. Perfect Conventional, highly 100,000 copies of 100% certainty forgery skilled forger who an existing note (with aid of (with perfectly copies that are perfect in operator different every dot on the all respects, but verification of serial whole note, then 100,000 notes all printed serial numbers) ensures that the have different number) printed serial serial numbers numbers increment. Large A massive effort, No more than one 50% certainty on scale where many notes are copy of any any one note-as effort collected, and each existing note is the single forgery (uneco- note is individually printed, but that cannot be nomic) analysed and copy is perfect in distinguished duplicated. all respects. The from the original. forgers analyse However, a and copy one note pattern of at a time. duplications would be evident if more than one forged note was passed at a time. Benefits of a Hyperlabel Security Document System Theft

Hyperlabel scanners report the locations of banknotes to a central secure database. Repositories of cash—banks, ATMs, cash registers, armored trucks, personal safes—that are equipped with Hyperlabel scanners have records of all of the serial numbers of the notes that should be in the repository. Whenever cash is stolen from such a repository, the central database operator can be notified, and the notes carrying the serial numbers will rapidly be registered as stolen. As the records are kept in a remote secure location (i.e. the central database), the records will not be stolen along with the cash.

The stolen status is rapidly and automatically disseminated to a huge number of outlets as varied as financial institutions and retailers. Each of those outlets will be able to rapidly, accurately and automatically identify stolen notes as part of their standard cash-handling procedures.

The stolen status is also rapidly and automatically disseminated to relevant agencies such as Customs, Immigration and Police, Hence law enforcement officers will be armed with mobile scanners that can accurately and immediately ascertain the status of suspect notes.

Once the stolen cash is used anywhere there is a Hyperlabel scanner, the cash will be identified as stolen. This places the thief in high danger of being caught. It would thus be very difficult for a thief to dispose of any significant amount of stolen cash.

Hyperlabel scanners can assist in the reduction of theft in many situations, including:

-   -   Bank and armored truck robbery: all notes would be immediately         ‘marked as stolen’ as soon as the thieves left the scene of the         crime.     -   Retail shops: late night shops, such as 7-eleven and gas         stations—are notoriously victims of small scale armed and         unarmed robberies. The reduction of this kind of theft should         make these occupations substantially safer.     -   For similar reasons, ATMs, personal and company safes, vending         machines, would all become significantly more secure.         Drug Dealing

Indirectly, this could also limit the activities of drug dealers. At the street level, many notes used to pay for drugs may be registered as stolen. As the number of these stolen notes accumulates, the cash flow pattern will be identified as suspicious. Therefore, drug dealers would want to be able to verify that any money paid to them was not stolen or counterfeit.

Ironically, drug dealers will not be able to use Hyperlabel scanners to verify the status of cash they are paid with, without also running the risk of being caught. If a drug dealer was frequently verifying large amounts of cash, where a large percentage of that cash was stolen, they could be investigated for money laundering.

Counterfeiting

As well as assisting in the apprehension of criminals, the collection of this data also allows the detection of sophisticated forgeries where the Hyperlabel dot patterns are exactly duplicated. This is because there will be multiple copies of exactly forged notes—at least the original and the forgery. For example, if multiple identical notes appear in different places at the same time, all but one of those notes must be a forgery. This applies even if the note is an absolutely perfect forgery, as no two Hyperlabel tags should ever be the same. An heuristic determines whether the appearance of a particular note in different places in quick succession is feasible. If successive appearances of a note are determined to be infeasible, the presence of a forgery is indicated.

Money Counting

Because the hyperlabel tags encode the denomination of currency, this allows money to be counted solely on the basis of hyperlabel detection. This avoids the need for the detection and interpretation of a visible numeral, which typically requires complex image processing to be performed, especially if the quality of the note is degraded due to extensive use.

It will be appreciated that in addition to this, as the denomination is repeated substantially over the entire currency, this ensures that the currency value can be determined even if a large portion of the note is damaged.

Money Laundering

As discussed in the background, there are two claim stages in money laundering, namely placement and wiring and integration.

It will be appreciated that by providing for tracking of each individual note utilising the Hyperlabel system described above, this makes it extremely difficult for placement to be carried out, primarily as each individual note can be tracked throughout its life. Accordingly, large amounts of currency suddenly entering into the circulation will be easily detectable primarily as there will be a break in the history of the note.

Thus, the system can utilise patent detection algorithms to identify when large volumes of currency either exit or enter into circulation thereby identifying potential sources of money laundering. In addition to this however currency in which has a certain times been owned by certain individuals can also be tracked. This allows patents within an individual's accounts usage to be determined which also helps identify money laundering.

Meeting Regulatory Requirements

It will be appreciated that by providing a database which can be used to track all currency, this allows banks to ensure regulatory requirements are satisfied. To even further aid with this, rules can be defined which represent the regulatory requirements. In this instance, when a transaction is to be performed, the transaction can be compared to the predetermined rules to determine if the transaction is allowable. This will effectively prevent unallowable transactions occurring thereby ensuring that the banks meet the regulatory requirements.

Cross Boarder Controls

In order to provide for cross boarder control, it is merely necessary to continuously monitor the location of currency documents. If currency documents on subsequent transactions are provided in different locations this indicates that the currency has been physically moved thereby allowing cross boarder currency movements to be determined.

Security Document Transfer

It will be appreciated that as the security document can be represented wholly electronically, by use of the identity and correspondence signature, it is possible to electronically transfer security documents. In this instance, specialised transfer machines can be provided which operate to destroy a currency document upon receipt. The document can be converted to an electronic form by identifying the corresponding document layout and tag map used to place the coded data thereon. This information can then be transferred to a corresponding machine in another location allowing the security document to be reproduced. Thus, the security document may transferred to one location to another location in an electronic form by ensuring that only one security document is produced this prevents document duplication whilst allowing secure transfer.

Advantages of a Hyperlabel Security Document System

The proposed Hyperlabel solution can be implemented to bring many advantages. Some of these include:

-   -   Unobtrusive to the public     -   Follows existing cash handling processes     -   Reduces reliance on paper trails     -   Provides a strong deterrent for accepting counterfeit currency     -   Provides a strong deterrent for laundering large amounts of cash     -   Efficient way to share resources across national and         international agencies     -   Improves confidence in the financial system     -   Limits the possibility of inexplicable changes in money demand     -   Reduces risk to integrity of financial institutions     -   Helps banks implement and automate due diligence methods for         cash transactions

There are several major advantages of Hyperlabel currency tags over other existing forms of note validation such as RFID, including:

-   -   Hyperlabel tags are invisible, so they do not affect note design         or graphics.     -   Hyperlabel tags can be implemented at very low cost—the tags are         just ink and are printed while the notes are still in roll form,         directly after the visible inks are printed.     -   Hyperlabel tagged currency is extremely difficult to forge.     -   Hyperlabel tags are printed over the entire note surface in a         highly redundant and fault tolerant manner.     -   Hyperlabel tags are very unlikely to become unreadable due to         note damage.     -   Hyperlabel tags can be scanned using a variety of scanners.     -   Currency location and reportable cash transaction data are         automatically collected.

Hyperlabels support omnidirectional reading, they can protect privacy, they can be produced for a low cost, and the ability of the scanners to read the tags is independent of packaging, contents, or environmental conditions.

One of the most effective methods to reduce the counterfeit risks considered above, is the introduction of a new form of currency incorporating a machine readable code, and the means to validate notes at key points where cash transactions occur. Counterfeit notes could then be detected at banks, currency exchanges, airports, retailers and bill payment service providers accepting cash payments. That is, the goal would be to identify and reject counterfeit notes before they enter the monetary system.

Counterfeit notes can vary in quality—depending on the level of skill of the counterfeiter and the choice of technology. Hyperlabel provides security against the full range of efforts—from casual forgery on a color photocopier, through to multi-million dollar efforts by professional criminals.

By implementing a Hyperlabel system, it becomes possible to monitor and forecast national and international cash flow changes, as well as provide alerts for any abnormal patterns that could lead to unwanted macroeconomic outcomes.

An automated Hyperlabel system aids with the record keeping, and provides the basis for additional ways to identify ‘suspicious activities’ involving cash that can occur.

In comparison, Hyperlabel tags can be produced at a low cost. They can be printed all over the surface of a note (redundancy) and they are easy to read. The IR ink ‘tags’ will not be damaged by folding, washing, physical impact or electrostatic shock, and cannot be torn out of the note. They can be used and read in the presence of radiopaque materials. They support omnidirectional reading, as well as very low cost proximity readers. Hyperlabel tags cannot be read while in the wallets of citizens, so do not present a threat of covert scanning providing information to criminals. This should make Hyperlabel tagged currency acceptable to privacy advocates concerned about the ability to read notes without the knowledge of the owner. They also meet current and anticipated regulations and guidelines for national and international agencies. An overview of the key components of a Hyperlabel system needed to achieve these objectives is provided in the next section.

Socioeconomic Consequences

Although there are significant advantages in implementing a Hyperlabel solution, there are also socioeconomic consequences that need to be noted.

Of primary concern is the consequence of Hyperlabel becoming a pervasive counterfeit detection and cash flow tracking system. This could effectively and materially hamper the activities of organized crime and terrorists relying on counterfeiting or laundering cash and it could prove to be disruptive as criminals find alternative methods to support their activities.

In this context, further questions ought to be considered before proceeding with implementation. Some of these include:

-   -   Will crime move to less regulated and less developed nations         causing further decline in their socioeconomic status?     -   Will electronic crime become more sophisticated?     -   How will Hyperlabel alter the structure of criminal and         terrorist networks?     -   The cash economy is often used by small businesses as a form of         tax evasion—what, if anything, will replace this once cash         becomes traceable?

RELATED APPLICATIONS

The Hyperlabel infrastructure can also be used to validate and track other ‘secure documents’ where the value of the document is based upon what it represents, rather than what it contains. Some examples are:

-   -   Government checks     -   Bank issued checks     -   Bearer bonds     -   Stock certificates     -   Lottery tickets     -   Event tickets     -   Passports     -   Medical certificates     -   Postage stamps     -   Food stamps

The Hyperlabel infrastructure is also shared with other applications, such as grocery tracking and interactive documents. 

We claim:
 1. A method of recording a transaction relating to a security document, the method comprising the steps of: providing on the security document a plurality of coded data portions, each coded data portion encoding an identity of the security document and part of a signature, the signature being a digital signature of at least part of the identity; sensing by a sensing device at least one coded data portion determining from the coded data portion sensed by the sensing device a determined identity and at least one determined signature part; authenticating the security document using the determined identity and the at least one determined signature part; and updating, upon successful authentication, transaction data associated with the security document stored in a data store.
 2. The method according to claim 1, wherein the transaction data is indicative of a location of the sensing device.
 3. The method according to claim 1, further comprising the step of: comparing the transaction data to at least one predetermined criterion.
 4. The method according to claim 1, wherein the signature is a digital signature of at least part of the identity and at least part of padding, the padding being at least one of: a predetermined number; and, a random number.
 5. The method according to claim 1, wherein the coded data portions include a plurality of layouts, each layout defining the position of a plurality of first symbols encoding the identity, and a plurality of second symbols encoding at least part of the signature.
 6. The method according to claim 1, wherein at least some of the coded data portions encode at least one of: a location of the respective coded data portion; a position of the respective coded data portion on the surface; a size of the coded data portions; a size of the signature; and an identity of the part of the signature.
 7. The method according to claim 1, wherein the coded data portions are arranged in accordance with at least one layout having n-fold rotational symmetry, where n is at least two, the layout including n identical sub-layouts rotated 1/n revolutions apart about a centre of rotation, at least one sub-layout including rotation-indicating data that distinguishes that sub-layout from each other sub-layout.
 8. The method according to claim 1, wherein the coded data portions are arranged in accordance with at least one layout having n-fold rotational symmetry, where n is at least two, the layout encoding orientation-indicating data comprising a sequence of an integer multiple m of n symbols, where m is one or more, each encoded symbol being distributed at n locations about a centre of rotational symmetry of the layout such that decoding the symbols at each of the n orientations of the layout produces n representations of the orientation-indicating data, each representation comprising a different cyclic shift of the orientation-indicating data and being indicative of the degree of rotation of the layout. 